[ Started: 2025-10-30 21:55:36 CET ] [ CellNOptR v1.54.0 for BioC-3.21 from https://git.bioconductor.org/packages/CellNOptR@RELEASE_3_21 (c2d1b49 2025-04-15 10:11:22) ] [1] "Libraries: " "/home/omnipath/local/R/4.5-3.21" [3] "/home/omnipath/local/R/4.5" "/usr/lib/R/library" trying URL 'https://cran.uni-muenster.de/src/contrib/emmeans_2.0.0.tar.gz' trying URL 'https://cran.uni-muenster.de/src/contrib/Seurat_5.3.1.tar.gz' trying URL 'https://cran.uni-muenster.de/src/contrib/SeuratObject_5.2.0.tar.gz' * installing *source* package ‘emmeans’ ... ** this is package ‘emmeans’ version ‘2.0.0’ ** package ‘emmeans’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/mvtnorm/libs/mvtnorm.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... namespaceImport -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘emmeans’ * removing ‘/home/omnipath/local/R/4.5-3.21/emmeans’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/emmeans’ * installing *source* package ‘SeuratObject’ ... ** this is package ‘SeuratObject’ version ‘5.2.0’ ** package ‘SeuratObject’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ using C++ compiler: ‘g++ (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RcppExports.cpp -o RcppExports.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from RcppExports.cpp:4: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:77:20: required from ‘void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix; Functor = Eigen::internal::assign_op; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/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::SparseMatrix; Src = Eigen::SparseMatrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:713:13: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenWrap.h:387:24: required from ‘Eigen::SparseMatrix Rcpp::traits::Exporter >::get() [with T = double]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:89:32: required from ‘T Rcpp::internal::as(SEXP, Rcpp::traits::r_type_generic_tag) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/InputParameter.h:34:43: required from ‘Rcpp::InputParameter::operator T() [with T = Eigen::SparseMatrix]’ RcppExports.cpp:20:55: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c data_manipulation.cpp -o data_manipulation.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from data_manipulation.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:27:22: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:33:26: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:33:26: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ data_manipulation.cpp:83:80: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:58:63: required from ‘struct Eigen::internal::unary_evaluator >, Eigen::internal::IteratorBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::Transpose >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:27:23: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:111:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c valid_pointer.c -o valid_pointer.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o SeuratObject.so RcppExports.o data_manipulation.o valid_pointer.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-SeuratObject/00new/SeuratObject/libs ** R ** data *** moving datasets to lazyload DB ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/spam/libs/spam.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... asNamespace -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘SeuratObject’ * removing ‘/home/omnipath/local/R/4.5-3.21/SeuratObject’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/SeuratObject’ * installing *source* package ‘Seurat’ ... ** this is package ‘Seurat’ version ‘5.3.1’ ** package ‘Seurat’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ using C++ compiler: ‘g++ (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ using C++17 g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ModularityOptimizer.cpp -o ModularityOptimizer.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RModularityOptimizer.cpp -o RModularityOptimizer.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from RModularityOptimizer.cpp:9: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RcppExports.cpp -o RcppExports.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from RcppExports.cpp:4: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ RcppExports.cpp:71:105: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:18:8: required from ‘struct Eigen::internal::traits > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48: required from ‘struct Eigen::internal::accessors_level > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75: required from ‘class Eigen::Map >’ RcppExports.cpp:94:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:24:49: required from ‘struct Eigen::internal::traits > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48: required from ‘struct Eigen::internal::accessors_level > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75: required from ‘class Eigen::Map >’ RcppExports.cpp:94:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:94:79: required from ‘class Eigen::Map >’ RcppExports.cpp:94:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ RcppExports.cpp:169:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:77:20: required from ‘void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix; Functor = Eigen::internal::assign_op; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/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::SparseMatrix; Src = Eigen::SparseMatrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:713:13: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenWrap.h:387:24: required from ‘Eigen::SparseMatrix Rcpp::traits::Exporter >::get() [with T = double]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:89:32: required from ‘T Rcpp::internal::as(SEXP, Rcpp::traits::r_type_generic_tag) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/InputParameter.h:34:43: required from ‘Rcpp::InputParameter::operator T() [with T = Eigen::SparseMatrix]’ RcppExports.cpp:29:60: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:77:20: required from ‘void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix; Functor = Eigen::internal::assign_op; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/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::SparseMatrix; Src = Eigen::SparseMatrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:713:13: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 1; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenWrap.h:412:24: required from ‘Eigen::SparseMatrix<_Scalar, 1> Rcpp::traits::Exporter >::get() [with T = double]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:89:32: required from ‘T Rcpp::internal::as(SEXP, Rcpp::traits::r_type_generic_tag) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/InputParameter.h:34:43: required from ‘Rcpp::InputParameter::operator T() [with T = Eigen::SparseMatrix]’ RcppExports.cpp:71:50: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c data_manipulation.cpp -o data_manipulation.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from data_manipulation.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:18:21: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:18:21: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:18:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ data_manipulation.cpp:18:71: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>’ data_manipulation.cpp:18:83: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ data_manipulation.cpp:75:127: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:24:49: required from ‘struct Eigen::internal::traits > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48: required from ‘struct Eigen::internal::accessors_level > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75: required from ‘class Eigen::Map >’ data_manipulation.cpp:131:88: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:94:79: required from ‘class Eigen::Map >’ data_manipulation.cpp:131:88: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:45:7: required from ‘class Eigen::Array’ data_manipulation.cpp:136:20: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl >, -1, 1, true, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block >, -1, 1, true>’ data_manipulation.cpp:136:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper >, -1, 1, true> >’ data_manipulation.cpp:136:40: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Array >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Array > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::Array > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, const Eigen::Array >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:138:32: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:138:32: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ data_manipulation.cpp:138:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:96:7: required from ‘class Eigen::internal::sparse_matrix_block_impl, -1, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:287:7: required from ‘class Eigen::BlockImpl, -1, 1, true, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, 1, true>’ data_manipulation.cpp:186:50: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, -1, 1, true, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, 1, true>’ data_manipulation.cpp:187:19: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper >’ data_manipulation.cpp:187:35: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:187:40: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:187:51: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:194:30: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::internal::member_sum, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:56:7: required from ‘class Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:229:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, const Eigen::Matrix >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:229:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:229:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Replicate.h:61:65: required from ‘class Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:231:37: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::Matrix, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::Matrix, 0, 8>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::Matrix, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::Matrix, 0>’ data_manipulation.cpp:231:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, const Eigen::Matrix >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, 1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl >, 1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block >, 1, -1, false>’ data_manipulation.cpp:368:29: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, false> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper >, 1, -1, false> >’ data_manipulation.cpp:368:38: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:58:63: required from ‘struct Eigen::internal::unary_evaluator >, Eigen::internal::IteratorBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::Transpose >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:150:23: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, -1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, -1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, -1, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CommaInitializer.h:99:21: required from ‘Eigen::CommaInitializer& Eigen::CommaInitializer::operator,(const Eigen::DenseBase&) [with OtherDerived = Eigen::Matrix; XprType = Eigen::Matrix]’ data_manipulation.cpp:249:17: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:110:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, 0, Eigen::OuterStride<> > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase, 0, Eigen::OuterStride<> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:50:7: required from ‘class Eigen::SparseMapBase, 0, Eigen::OuterStride<> >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:83:34: required from ‘class Eigen::internal::SparseRefBase, 0, Eigen::OuterStride<> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:177:7: required from ‘class Eigen::Ref, 0, Eigen::OuterStride<> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:128:88: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, 0, Eigen::OuterStride<> >, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:17:7: required from ‘class Eigen::BlockImpl, 0, Eigen::OuterStride<> >, -1, 1, true, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, 0, Eigen::OuterStride<> >, -1, 1, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:194:85: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::Array; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Array; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Array; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:478:32: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::mean() const [with Derived = Eigen::Array; typename Eigen::internal::traits::Scalar = double]’ data_manipulation.cpp:137:28: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; typename Eigen::internal::traits::Scalar = double]’ data_manipulation.cpp:138:53: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:883:17: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Array; Src = Eigen::ArrayWrapper >, 1, -1, false> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:288:29: required from ‘Eigen::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const Eigen::EigenBase&, typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1; typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type = Eigen::Array::PrivateType; typename OtherDerived::Scalar = double; typename Eigen::internal::traits >::Scalar = double]’ data_manipulation.cpp:368:39: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0, Eigen::OuterStride<> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator, 0, Eigen::OuterStride<> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:364:8: required from ‘struct Eigen::internal::evaluator, 0, Eigen::OuterStride<> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:45:21: required from ‘Eigen::Index Eigen::BlockImpl::nonZeros() const [with XprType = Eigen::Ref, 0, Eigen::OuterStride<> >; int BlockRows = -1; int BlockCols = 1; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:194:97: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:277: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1384:41: required from ‘struct Eigen::internal::evaluator_wrapper_base >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1464:8: required from ‘struct Eigen::internal::unary_evaluator >, -1, 1, true> >, Eigen::internal::IndexBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/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::Array; SrcXprType = Eigen::ArrayWrapper >, -1, 1, true> >; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Array; SrcXprType = Eigen::ArrayWrapper >, -1, 1, true> >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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::Array; Src = Eigen::ArrayWrapper >, -1, 1, true> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, -1, 1, true> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, -1, 1, true> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:288:29: required from ‘Eigen::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const Eigen::EigenBase&, typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type) [with OtherDerived = Eigen::ArrayWrapper >, -1, 1, true> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1; typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type = Eigen::Array::PrivateType; typename OtherDerived::Scalar = double; typename Eigen::internal::traits >::Scalar = double]’ data_manipulation.cpp:136:41: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/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, -1, 1, true>; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block, -1, 1, true>; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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, -1, 1, true>; Src = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/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::value), void*>::type) [with Dst = Eigen::Block, -1, 1, true>; Src = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block, -1, 1, true>; Src = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Assign.h:66:28: required from ‘Derived& Eigen::MatrixBase::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Derived = Eigen::Block, -1, 1, true>]’ data_manipulation.cpp:187:51: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, 1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1384:41: required from ‘struct Eigen::internal::evaluator_wrapper_base >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1464:8: required from ‘struct Eigen::internal::unary_evaluator >, 1, -1, false> >, Eigen::internal::IndexBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/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::Transpose >; SrcXprType = Eigen::ArrayWrapper >, 1, -1, false> >; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::ArrayWrapper >, 1, -1, false> >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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::Array; Src = Eigen::ArrayWrapper >, 1, -1, false> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:288:29: required from ‘Eigen::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const Eigen::EigenBase&, typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1; typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type = Eigen::Array::PrivateType; typename OtherDerived::Scalar = double; typename Eigen::internal::traits >::Scalar = double]’ data_manipulation.cpp:368:39: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:549:8: required from ‘struct Eigen::internal::unary_evaluator, -1, 1, true>, Eigen::internal::IteratorBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1087:8: required from ‘struct Eigen::internal::block_evaluator, -1, 1, true, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1034:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:217:9: required from ‘void Eigen::Ref, _Options, _StrideType>::construct(const Expression&, Eigen::internal::true_type) [with Expression = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:190:16: required from ‘Eigen::Ref, _Options, _StrideType>::Ref(const Eigen::SparseMatrixBase&) [with Derived = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:128:88: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:217:9: required from ‘void Eigen::Ref, _Options, _StrideType>::construct(const Expression&, Eigen::internal::true_type) [with Expression = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:190:16: required from ‘Eigen::Ref, _Options, _StrideType>::Ref(const Eigen::SparseMatrixBase&) [with Derived = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:128:88: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/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, -1, -1, false>; SrcXprType = Eigen::Matrix; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block, -1, -1, false>; SrcXprType = Eigen::Matrix; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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, -1, -1, false>; Src = Eigen::Matrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/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::value), void*>::type) [with Dst = Eigen::Block, -1, -1, false>; Src = Eigen::Matrix; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block, -1, -1, false>; Src = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Assign.h:66:28: required from ‘Derived& Eigen::MatrixBase::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::Matrix; Derived = Eigen::Block, -1, -1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CommaInitializer.h:99:64: required from ‘Eigen::CommaInitializer& Eigen::CommaInitializer::operator,(const Eigen::DenseBase&) [with OtherDerived = Eigen::Matrix; XprType = Eigen::Matrix]’ data_manipulation.cpp:249:17: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, const Eigen::Block, -1, 1, true>, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, const Eigen::Block, -1, 1, true>, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, const Eigen::Block, -1, 1, true>, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, const Eigen::Block, -1, 1, true>, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, const Eigen::Block, -1, 1, true>, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, const Eigen::Block, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:345:45: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:370:45: required from ‘struct Eigen::internal::generic_product_impl >, const Eigen::Block, -1, 1, true>, Eigen::DenseShape, Eigen::DenseShape, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, Eigen::Matrix, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true>, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true>, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, 1, -1, true>, Eigen::Matrix, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, 1, -1, true>, Eigen::Matrix, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, 1, -1, true>, Eigen::Matrix, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:345:45: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 1, -1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, 1, -1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, 1, -1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval >, 1, -1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45: required from ‘struct Eigen::internal::generic_product_impl >, 1, -1, true>, Eigen::Matrix, Eigen::DenseShape, Eigen::DenseShape, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:486:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::Matrix, 1>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::Matrix, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::Matrix, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::Matrix, 1, 8>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::Matrix, 1, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::Matrix, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:462:68: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30: required from ‘Derived& Eigen::DenseBase::setConstant(const Scalar&) [with Derived = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10: required from ‘Derived& Eigen::DenseBase::setZero() [with Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:444:18: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true>, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 1, -1, true>, 1, -1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, 1, -1, true>, 1, -1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0, Eigen::Stride<0, 0> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 0, Eigen::Stride<0, 0> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 0, Eigen::Stride<0, 0> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 0, Eigen::Stride<0, 0> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 0, Eigen::Stride<0, 0> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 0, Eigen::Stride<0, 0> >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:333: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:306:38: required from ‘struct Eigen::internal::general_matrix_vector_product, 1, false, double, Eigen::internal::const_blas_data_mapper, false, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:347:132: required from ‘static void Eigen::internal::gemv_dense_selector<2, 1, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose >; Rhs = Eigen::Block, -1, 1, true>; Dest = Eigen::Block, -1, 1, true>; typename Dest::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block, -1, 1, true>; Lhs = Eigen::Transpose >; Rhs = const Eigen::Block, -1, 1, true>; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 52 | unpacket_traits<_RhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1 | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 59 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 60 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 61 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:310:42: required from ‘struct Eigen::internal::general_matrix_vector_product, 1, false, double, Eigen::internal::const_blas_data_mapper, false, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:347:132: required from ‘static void Eigen::internal::gemv_dense_selector<2, 1, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose >; Rhs = Eigen::Block, -1, 1, true>; Dest = Eigen::Block, -1, 1, true>; typename Dest::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block, -1, 1, true>; Lhs = Eigen::Transpose >; Rhs = const Eigen::Block, -1, 1, true>; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 52 | unpacket_traits<_RhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1 | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 59 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 60 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 61 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:314:45: required from ‘struct Eigen::internal::general_matrix_vector_product, 1, false, double, Eigen::internal::const_blas_data_mapper, false, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:347:132: required from ‘static void Eigen::internal::gemv_dense_selector<2, 1, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose >; Rhs = Eigen::Block, -1, 1, true>; Dest = Eigen::Block, -1, 1, true>; typename Dest::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block, -1, 1, true>; Lhs = Eigen::Transpose >; Rhs = const Eigen::Block, -1, 1, true>; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 52 | unpacket_traits<_RhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1 | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 59 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 60 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 61 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, 1, -1, false>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true> >, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl >, 1, -1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:43: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:56: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>; U = Eigen::Block, -1, 1, true>, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true> >, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl >, 1, -1, true>, 1, -1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:23: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:56: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>, 1, -1, true>; U = Eigen::Block, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false> >, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:330: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:147:40: required from ‘void Eigen::internal::evaluateProductBlockingSizesHeuristic(Index&, Index&, Index&, Index) [with LhsScalar = double; RhsScalar = double; int KcFactor = 1; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:342:81: required from ‘void Eigen::internal::computeProductBlockingSizes(Index&, Index&, Index&, Index) [with LhsScalar = double; RhsScalar = double; int KcFactor = 1; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:355:66: required from ‘Eigen::internal::gemm_blocking_space::gemm_blocking_space(Eigen::Index, Eigen::Index, Eigen::Index, Eigen::Index, bool) [with int StorageOrder = 0; _LhsScalar = double; _RhsScalar = double; int MaxRows = -1; int MaxCols = -1; int MaxDepth = -1; int KcFactor = 1; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:507:18: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 460 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 461 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 462 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 465 | typedef QuadPacket RhsPacketx4; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1080:42: required from ‘struct Eigen::internal::gebp_kernel, 4, 4, false, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:82:107: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 460 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 461 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 462 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 465 | typedef QuadPacket RhsPacketx4; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1085:45: required from ‘struct Eigen::internal::gebp_kernel, 4, 4, false, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:82:107: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 460 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 461 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 462 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 465 | typedef QuadPacket RhsPacketx4; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gemm_pack_lhs::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long int; DataMapper = Eigen::internal::const_blas_data_mapper; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:184:17: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/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::half>::half QuarterPacket; | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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::size, | ^~~~ /home/omnipath/local/R/4.5-3.21/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::size, | ^~~~ /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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 kernel_half; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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 kernel_quarter; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gemm_pack_rhs::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long int; DataMapper = Eigen::internal::const_blas_data_mapper; int nr = 4; bool Conjugate = false; bool PanelMode = false]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:195:21: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2459:62: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 2459 | PacketBlock kernel; | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gebp_kernel::operator()(const DataMapper&, const LhsScalar*, const RhsScalar*, Index, Index, Index, ResScalar, Index, Index, Index, Index) [with LhsScalar = double; RhsScalar = double; Index = long int; DataMapper = Eigen::internal::blas_data_mapper; int mr = 4; int nr = 4; bool ConjugateLhs = false; bool ConjugateRhs = false; ResScalar = double]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:198:15: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/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::half>::size; | ^~~~ /home/omnipath/local/R/4.5-3.21/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::half>::half>::size; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1921:138: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SResPacket>::type SResPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SLhsPacket>::type SLhsPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SRhsPacket>::type SRhsPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SAccPacket>::type SAccPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true>, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:78: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41: required from ‘struct Eigen::internal::unary_evaluator >, 1, -1, true>, 1, -1, true> >, Eigen::internal::IndexBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:52: required from ‘const Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::CoeffReturnType Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::coeff(Eigen::Index, Eigen::Index) const [with Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; int ProductTag = 8; typename Eigen::internal::traits::Lhs>::Scalar = double; typename Eigen::Product::Lhs = Eigen::Transpose >; typename Eigen::internal::traits::Rhs>::Scalar = double; typename Eigen::Product::Rhs = Eigen::Matrix; CoeffReturnType = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:63: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>; U = Eigen::Block, -1, 1, true>, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: required from ‘typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType Eigen::MatrixBase::dot(const Eigen::MatrixBase&) const [with OtherDerived = Eigen::Block, -1, 1, true>, -1, 1, true>; Derived = Eigen::Block >, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType = double; typename Eigen::internal::traits::Scalar = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:63: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>, 1, -1, true>; U = Eigen::Block, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: required from ‘typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType Eigen::MatrixBase::dot(const Eigen::MatrixBase&) const [with OtherDerived = Eigen::Block, -1, 1, true>; Derived = Eigen::Block >, 1, -1, true>, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType = double; typename Eigen::internal::traits::Scalar = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:75: required from ‘const Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::CoeffReturnType Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::coeff(Eigen::Index, Eigen::Index) const [with Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; int ProductTag = 8; typename Eigen::internal::traits::Lhs>::Scalar = double; typename Eigen::Product::Lhs = Eigen::Transpose >; typename Eigen::internal::traits::Rhs>::Scalar = double; typename Eigen::Product::Rhs = Eigen::Matrix; CoeffReturnType = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63: required from ‘void Eigen::internal::generic_dense_assignment_kernel::assignCoeff(Eigen::Index, Eigen::Index) [with DstEvaluatorTypeT = Eigen::internal::evaluator >; SrcEvaluatorTypeT = Eigen::internal::evaluator >, Eigen::Matrix, 1> >; Functor = Eigen::internal::assign_op; int Version = 1; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:668:16: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::Block, -1, 1, true>; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Block, -1, 1, true>; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, -1, 1, true> >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum::operator()(const XprType&) const [with XprType = Eigen::Block, -1, 1, true>; ResultType = double; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator >::Scalar Eigen::internal::evaluator >::coeff(Eigen::Index) const [with ArgType = Eigen::Matrix; MemberOp = Eigen::internal::member_sum; int Direction = 0; Scalar = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:775:40: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/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::value), void*>::type) [with Dst = Eigen::Matrix; Src = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix; Src = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32: required from ‘Derived& Eigen::PlainObjectBase::_set(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fast_NN_dist.cpp -o fast_NN_dist.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c integration.cpp -o integration.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from integration.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ integration.cpp:23:1: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ integration.cpp:23:1: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ integration.cpp:23:1: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, 1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, 1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, 1, -1, false>’ integration.cpp:43:41: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ integration.cpp:60:53: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ integration.cpp:60:79: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>’ integration.cpp:60:99: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ integration.cpp:68:61: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::internal::member_sum, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:56:7: required from ‘class Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>’ integration.cpp:77:57: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseView.h:45:7: required from ‘class Eigen::SparseView >’ integration.cpp:83:41: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >, Eigen::SparseMatrix, 2> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:145:7: required from ‘class Eigen::ProductImpl >, Eigen::SparseMatrix, 2, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::SparseMatrix, 2>’ integration.cpp:94:85: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCwiseBinaryOp.h:36:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2>, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> >’ integration.cpp:94:85: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, -1, 1, true, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, 1, true>’ integration.cpp:140:36: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >’ integration.cpp:140:60: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCwiseBinaryOp.h:64:51: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> >, Eigen::internal::IteratorBased, Eigen::internal::IteratorBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ integration.cpp:94:85: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1126:103: required from ‘void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&, DupFunctor) [with InputIterators = __gnu_cxx::__normal_iterator*, std::vector > >; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::; _Scalar = double; int _Options = 0; _StorageIndex = int]’ integration.cpp:59:33: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:40: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ integration.cpp:140:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1126:103: required from ‘void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&, DupFunctor) [with InputIterators = __gnu_cxx::__normal_iterator*, std::vector > >; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::; _Scalar = double; int _Options = 0; _StorageIndex = int]’ integration.cpp:59:33: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:883:17: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Matrix; Src = Eigen::Block, 1, -1, false>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:43:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:277: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:46: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ integration.cpp:140:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, 1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/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::Transpose >; SrcXprType = Eigen::Block, 1, -1, false>; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::Block, 1, -1, false>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::Block, 1, -1, false>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:43:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:46: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ integration.cpp:140:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::PartialReduxExpr, member_sum, 0>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:77:58: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum::operator()(const XprType&) const [with XprType = Eigen::Block, -1, 1, true>; ResultType = double; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator >::Scalar Eigen::internal::evaluator >::coeff(Eigen::Index) const [with ArgType = Eigen::Matrix; MemberOp = Eigen::internal::member_sum; int Direction = 0; Scalar = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::PartialReduxExpr, member_sum, 0>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:77:58: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::Block, -1, 1, true>; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Block, -1, 1, true>; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, -1, 1, true> >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum::operator()(const XprType&) const [with XprType = Eigen::Block, -1, 1, true>; ResultType = double; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator >::Scalar Eigen::internal::evaluator >::coeff(Eigen::Index) const [with ArgType = Eigen::Matrix; MemberOp = Eigen::internal::member_sum; int Direction = 0; Scalar = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::PartialReduxExpr, member_sum, 0>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:77:58: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c snn.cpp -o snn.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from snn.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ snn.cpp:16:79: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ snn.cpp:16:79: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ snn.cpp:27:29: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, Eigen::Transpose >, 2> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:145:7: required from ‘class Eigen::ProductImpl, Eigen::Transpose >, 2, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product, Eigen::Transpose >, 2>’ snn.cpp:27:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, 1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, 1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, 1, -1, false>’ snn.cpp:106:30: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >’ snn.cpp:106:48: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ snn.cpp:26:22: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:40: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ snn.cpp:106:55: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ snn.cpp:26:22: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseUtil.h:121:8: required from ‘struct Eigen::internal::plain_object_eval, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseProduct.h:71:53: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dest&, const Lhs&, const Rhs&, Eigen::SparseShape) [with Dest = Eigen::SparseMatrix; Lhs = Eigen::SparseMatrix; Rhs = Eigen::Transpose >; int ProductType = 8]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseProduct.h:43:11: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dest&, const Lhs&, const Rhs&) [with Dest = Eigen::SparseMatrix; Lhs = Eigen::SparseMatrix; Rhs = Eigen::Transpose >; int ProductType = 8]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseProduct.h:174:51: required from ‘Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::Product&) [with Lhs = Eigen::SparseMatrix; Rhs = Eigen::Transpose >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ snn.cpp:27:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:277: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, 1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:46: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ snn.cpp:106:55: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stats.cpp -o stats.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c valid_pointer.c -o valid_pointer.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o Seurat.so ModularityOptimizer.o RModularityOptimizer.o RcppExports.o data_manipulation.o fast_NN_dist.o integration.o snn.o stats.o valid_pointer.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-Seurat/00new/Seurat/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading Error: package or namespace load failed for ‘SeuratObject’ in dyn.load(file, DLLpath = DLLpath, ...): unable to load shared object '/home/omnipath/local/R/4.5-3.21/spam/libs/spam.so': libRblas.so: cannot open shared object file: No such file or directory Execution halted ERROR: lazy loading failed for package ‘Seurat’ * removing ‘/home/omnipath/local/R/4.5-3.21/Seurat’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/Seurat’ The downloaded source packages are in ‘/tmp/RtmpAMOq6W/downloaded_packages’ Warning messages: 1: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘emmeans’ had non-zero exit status 2: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘SeuratObject’ had non-zero exit status 3: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘Seurat’ had non-zero exit status Bioconductor version '3.21' is out-of-date; the current release version '3.22' is available with R version '4.5'; see https://bioconductor.org/install 'getOption("repos")' replaces Bioconductor standard repositories, see 'help("repositories", package = "BiocManager")' for details. Replacement repositories: CRAN: https://cloud.r-project.org Bioconductor version 3.21 (BiocManager 1.30.26), R 4.5.1 (2025-06-13) Old packages: 'emmeans', 'enrichplot', 'ggtree', 'GSVA', 'Seurat', 'SeuratObject' trying URL 'https://cloud.r-project.org/src/contrib/emmeans_2.0.0.tar.gz' trying URL 'https://bioconductor.org/packages/3.21/bioc/src/contrib/enrichplot_1.28.4.tar.gz' trying URL 'https://bioconductor.org/packages/3.21/bioc/src/contrib/ggtree_3.16.3.tar.gz' trying URL 'https://bioconductor.org/packages/3.21/bioc/src/contrib/GSVA_2.2.1.tar.gz' trying URL 'https://cloud.r-project.org/src/contrib/Seurat_5.3.1.tar.gz' trying URL 'https://cloud.r-project.org/src/contrib/SeuratObject_5.2.0.tar.gz' * installing *source* package ‘emmeans’ ... ** this is package ‘emmeans’ version ‘2.0.0’ ** package ‘emmeans’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/mvtnorm/libs/mvtnorm.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... namespaceImport -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘emmeans’ * removing ‘/home/omnipath/local/R/4.5-3.21/emmeans’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/emmeans’ * installing *source* package ‘ggtree’ ... ** this is package ‘ggtree’ version ‘3.16.3’ ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/ape/libs/ape.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... asNamespace -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘ggtree’ * removing ‘/home/omnipath/local/R/4.5-3.21/ggtree’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/ggtree’ * installing *source* package ‘GSVA’ ... ** this is package ‘GSVA’ version ‘2.2.1’ ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ecdfvals.c -o ecdfvals.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c kcdfvals.c -o kcdfvals.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c kernel_estimation.c -o kernel_estimation.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ks_test.c -o ks_test.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c register_cmethods.c -o register_cmethods.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -std=gnu2x -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o GSVA.so ecdfvals.o kcdfvals.o kernel_estimation.o ks_test.o register_cmethods.o utils.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-GSVA/00new/GSVA/libs ** R ** inst ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/irlba/libs/irlba.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... asNamespace -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘GSVA’ * removing ‘/home/omnipath/local/R/4.5-3.21/GSVA’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/GSVA’ * installing *source* package ‘SeuratObject’ ... ** this is package ‘SeuratObject’ version ‘5.2.0’ ** package ‘SeuratObject’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ using C++ compiler: ‘g++ (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RcppExports.cpp -o RcppExports.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from RcppExports.cpp:4: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:77:20: required from ‘void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix; Functor = Eigen::internal::assign_op; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/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::SparseMatrix; Src = Eigen::SparseMatrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:713:13: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenWrap.h:387:24: required from ‘Eigen::SparseMatrix Rcpp::traits::Exporter >::get() [with T = double]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:89:32: required from ‘T Rcpp::internal::as(SEXP, Rcpp::traits::r_type_generic_tag) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/InputParameter.h:34:43: required from ‘Rcpp::InputParameter::operator T() [with T = Eigen::SparseMatrix]’ RcppExports.cpp:20:55: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c data_manipulation.cpp -o data_manipulation.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from data_manipulation.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:27:22: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:33:26: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:33:26: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ data_manipulation.cpp:83:80: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:58:63: required from ‘struct Eigen::internal::unary_evaluator >, Eigen::internal::IteratorBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::Transpose >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:27:23: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:111:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c valid_pointer.c -o valid_pointer.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o SeuratObject.so RcppExports.o data_manipulation.o valid_pointer.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-SeuratObject/00new/SeuratObject/libs ** R ** data *** moving datasets to lazyload DB ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/spam/libs/spam.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... asNamespace -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘SeuratObject’ * removing ‘/home/omnipath/local/R/4.5-3.21/SeuratObject’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/SeuratObject’ * installing *source* package ‘enrichplot’ ... ** this is package ‘enrichplot’ version ‘1.28.4’ ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/ape/libs/ape.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... asNamespace -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘enrichplot’ * removing ‘/home/omnipath/local/R/4.5-3.21/enrichplot’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/enrichplot’ * installing *source* package ‘Seurat’ ... ** this is package ‘Seurat’ version ‘5.3.1’ ** package ‘Seurat’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ using C++ compiler: ‘g++ (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ using C++17 g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ModularityOptimizer.cpp -o ModularityOptimizer.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RModularityOptimizer.cpp -o RModularityOptimizer.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from RModularityOptimizer.cpp:9: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RcppExports.cpp -o RcppExports.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from RcppExports.cpp:4: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ RcppExports.cpp:71:105: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:18:8: required from ‘struct Eigen::internal::traits > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48: required from ‘struct Eigen::internal::accessors_level > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75: required from ‘class Eigen::Map >’ RcppExports.cpp:94:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:24:49: required from ‘struct Eigen::internal::traits > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48: required from ‘struct Eigen::internal::accessors_level > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75: required from ‘class Eigen::Map >’ RcppExports.cpp:94:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:94:79: required from ‘class Eigen::Map >’ RcppExports.cpp:94:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ RcppExports.cpp:169:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:77:20: required from ‘void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix; Functor = Eigen::internal::assign_op; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/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::SparseMatrix; Src = Eigen::SparseMatrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:713:13: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenWrap.h:387:24: required from ‘Eigen::SparseMatrix Rcpp::traits::Exporter >::get() [with T = double]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:89:32: required from ‘T Rcpp::internal::as(SEXP, Rcpp::traits::r_type_generic_tag) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/InputParameter.h:34:43: required from ‘Rcpp::InputParameter::operator T() [with T = Eigen::SparseMatrix]’ RcppExports.cpp:29:60: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:77:20: required from ‘void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix; Functor = Eigen::internal::assign_op; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/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::SparseMatrix; Src = Eigen::SparseMatrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:713:13: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 1; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenWrap.h:412:24: required from ‘Eigen::SparseMatrix<_Scalar, 1> Rcpp::traits::Exporter >::get() [with T = double]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:89:32: required from ‘T Rcpp::internal::as(SEXP, Rcpp::traits::r_type_generic_tag) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/InputParameter.h:34:43: required from ‘Rcpp::InputParameter::operator T() [with T = Eigen::SparseMatrix]’ RcppExports.cpp:71:50: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c data_manipulation.cpp -o data_manipulation.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from data_manipulation.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:18:21: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:18:21: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:18:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ data_manipulation.cpp:18:71: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>’ data_manipulation.cpp:18:83: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ data_manipulation.cpp:75:127: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:24:49: required from ‘struct Eigen::internal::traits > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48: required from ‘struct Eigen::internal::accessors_level > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75: required from ‘class Eigen::Map >’ data_manipulation.cpp:131:88: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:94:79: required from ‘class Eigen::Map >’ data_manipulation.cpp:131:88: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:45:7: required from ‘class Eigen::Array’ data_manipulation.cpp:136:20: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl >, -1, 1, true, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block >, -1, 1, true>’ data_manipulation.cpp:136:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper >, -1, 1, true> >’ data_manipulation.cpp:136:40: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Array >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Array > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::Array > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, const Eigen::Array >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:138:32: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:138:32: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ data_manipulation.cpp:138:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:96:7: required from ‘class Eigen::internal::sparse_matrix_block_impl, -1, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:287:7: required from ‘class Eigen::BlockImpl, -1, 1, true, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, 1, true>’ data_manipulation.cpp:186:50: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, -1, 1, true, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, 1, true>’ data_manipulation.cpp:187:19: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper >’ data_manipulation.cpp:187:35: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:187:40: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:187:51: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:194:30: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::internal::member_sum, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:56:7: required from ‘class Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:229:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, const Eigen::Matrix >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:229:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:229:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Replicate.h:61:65: required from ‘class Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:231:37: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::Matrix, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::Matrix, 0, 8>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::Matrix, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::Matrix, 0>’ data_manipulation.cpp:231:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, const Eigen::Matrix >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, 1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl >, 1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block >, 1, -1, false>’ data_manipulation.cpp:368:29: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, false> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper >, 1, -1, false> >’ data_manipulation.cpp:368:38: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:58:63: required from ‘struct Eigen::internal::unary_evaluator >, Eigen::internal::IteratorBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::Transpose >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:150:23: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, -1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, -1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, -1, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CommaInitializer.h:99:21: required from ‘Eigen::CommaInitializer& Eigen::CommaInitializer::operator,(const Eigen::DenseBase&) [with OtherDerived = Eigen::Matrix; XprType = Eigen::Matrix]’ data_manipulation.cpp:249:17: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:110:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, 0, Eigen::OuterStride<> > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase, 0, Eigen::OuterStride<> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:50:7: required from ‘class Eigen::SparseMapBase, 0, Eigen::OuterStride<> >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:83:34: required from ‘class Eigen::internal::SparseRefBase, 0, Eigen::OuterStride<> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:177:7: required from ‘class Eigen::Ref, 0, Eigen::OuterStride<> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:128:88: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, 0, Eigen::OuterStride<> >, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:17:7: required from ‘class Eigen::BlockImpl, 0, Eigen::OuterStride<> >, -1, 1, true, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, 0, Eigen::OuterStride<> >, -1, 1, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:194:85: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::Array; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Array; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Array; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:478:32: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::mean() const [with Derived = Eigen::Array; typename Eigen::internal::traits::Scalar = double]’ data_manipulation.cpp:137:28: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; typename Eigen::internal::traits::Scalar = double]’ data_manipulation.cpp:138:53: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:883:17: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Array; Src = Eigen::ArrayWrapper >, 1, -1, false> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:288:29: required from ‘Eigen::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const Eigen::EigenBase&, typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1; typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type = Eigen::Array::PrivateType; typename OtherDerived::Scalar = double; typename Eigen::internal::traits >::Scalar = double]’ data_manipulation.cpp:368:39: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0, Eigen::OuterStride<> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator, 0, Eigen::OuterStride<> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:364:8: required from ‘struct Eigen::internal::evaluator, 0, Eigen::OuterStride<> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:45:21: required from ‘Eigen::Index Eigen::BlockImpl::nonZeros() const [with XprType = Eigen::Ref, 0, Eigen::OuterStride<> >; int BlockRows = -1; int BlockCols = 1; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:194:97: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:277: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1384:41: required from ‘struct Eigen::internal::evaluator_wrapper_base >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1464:8: required from ‘struct Eigen::internal::unary_evaluator >, -1, 1, true> >, Eigen::internal::IndexBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/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::Array; SrcXprType = Eigen::ArrayWrapper >, -1, 1, true> >; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Array; SrcXprType = Eigen::ArrayWrapper >, -1, 1, true> >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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::Array; Src = Eigen::ArrayWrapper >, -1, 1, true> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, -1, 1, true> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, -1, 1, true> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:288:29: required from ‘Eigen::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const Eigen::EigenBase&, typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type) [with OtherDerived = Eigen::ArrayWrapper >, -1, 1, true> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1; typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type = Eigen::Array::PrivateType; typename OtherDerived::Scalar = double; typename Eigen::internal::traits >::Scalar = double]’ data_manipulation.cpp:136:41: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/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, -1, 1, true>; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block, -1, 1, true>; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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, -1, 1, true>; Src = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/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::value), void*>::type) [with Dst = Eigen::Block, -1, 1, true>; Src = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block, -1, 1, true>; Src = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Assign.h:66:28: required from ‘Derived& Eigen::MatrixBase::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Derived = Eigen::Block, -1, 1, true>]’ data_manipulation.cpp:187:51: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, 1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1384:41: required from ‘struct Eigen::internal::evaluator_wrapper_base >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1464:8: required from ‘struct Eigen::internal::unary_evaluator >, 1, -1, false> >, Eigen::internal::IndexBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/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::Transpose >; SrcXprType = Eigen::ArrayWrapper >, 1, -1, false> >; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::ArrayWrapper >, 1, -1, false> >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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::Array; Src = Eigen::ArrayWrapper >, 1, -1, false> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:288:29: required from ‘Eigen::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const Eigen::EigenBase&, typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1; typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type = Eigen::Array::PrivateType; typename OtherDerived::Scalar = double; typename Eigen::internal::traits >::Scalar = double]’ data_manipulation.cpp:368:39: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:549:8: required from ‘struct Eigen::internal::unary_evaluator, -1, 1, true>, Eigen::internal::IteratorBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1087:8: required from ‘struct Eigen::internal::block_evaluator, -1, 1, true, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1034:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:217:9: required from ‘void Eigen::Ref, _Options, _StrideType>::construct(const Expression&, Eigen::internal::true_type) [with Expression = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:190:16: required from ‘Eigen::Ref, _Options, _StrideType>::Ref(const Eigen::SparseMatrixBase&) [with Derived = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:128:88: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:217:9: required from ‘void Eigen::Ref, _Options, _StrideType>::construct(const Expression&, Eigen::internal::true_type) [with Expression = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:190:16: required from ‘Eigen::Ref, _Options, _StrideType>::Ref(const Eigen::SparseMatrixBase&) [with Derived = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:128:88: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/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, -1, -1, false>; SrcXprType = Eigen::Matrix; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block, -1, -1, false>; SrcXprType = Eigen::Matrix; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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, -1, -1, false>; Src = Eigen::Matrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/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::value), void*>::type) [with Dst = Eigen::Block, -1, -1, false>; Src = Eigen::Matrix; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block, -1, -1, false>; Src = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Assign.h:66:28: required from ‘Derived& Eigen::MatrixBase::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::Matrix; Derived = Eigen::Block, -1, -1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CommaInitializer.h:99:64: required from ‘Eigen::CommaInitializer& Eigen::CommaInitializer::operator,(const Eigen::DenseBase&) [with OtherDerived = Eigen::Matrix; XprType = Eigen::Matrix]’ data_manipulation.cpp:249:17: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, const Eigen::Block, -1, 1, true>, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, const Eigen::Block, -1, 1, true>, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, const Eigen::Block, -1, 1, true>, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, const Eigen::Block, -1, 1, true>, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, const Eigen::Block, -1, 1, true>, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, const Eigen::Block, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:345:45: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:370:45: required from ‘struct Eigen::internal::generic_product_impl >, const Eigen::Block, -1, 1, true>, Eigen::DenseShape, Eigen::DenseShape, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, Eigen::Matrix, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true>, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true>, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, 1, -1, true>, Eigen::Matrix, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, 1, -1, true>, Eigen::Matrix, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, 1, -1, true>, Eigen::Matrix, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:345:45: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 1, -1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, 1, -1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, 1, -1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval >, 1, -1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45: required from ‘struct Eigen::internal::generic_product_impl >, 1, -1, true>, Eigen::Matrix, Eigen::DenseShape, Eigen::DenseShape, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:486:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::Matrix, 1>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::Matrix, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::Matrix, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::Matrix, 1, 8>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::Matrix, 1, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::Matrix, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:462:68: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30: required from ‘Derived& Eigen::DenseBase::setConstant(const Scalar&) [with Derived = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10: required from ‘Derived& Eigen::DenseBase::setZero() [with Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:444:18: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true>, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 1, -1, true>, 1, -1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, 1, -1, true>, 1, -1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0, Eigen::Stride<0, 0> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 0, Eigen::Stride<0, 0> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 0, Eigen::Stride<0, 0> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 0, Eigen::Stride<0, 0> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 0, Eigen::Stride<0, 0> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 0, Eigen::Stride<0, 0> >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:333: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:306:38: required from ‘struct Eigen::internal::general_matrix_vector_product, 1, false, double, Eigen::internal::const_blas_data_mapper, false, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:347:132: required from ‘static void Eigen::internal::gemv_dense_selector<2, 1, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose >; Rhs = Eigen::Block, -1, 1, true>; Dest = Eigen::Block, -1, 1, true>; typename Dest::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block, -1, 1, true>; Lhs = Eigen::Transpose >; Rhs = const Eigen::Block, -1, 1, true>; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 52 | unpacket_traits<_RhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1 | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 59 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 60 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 61 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:310:42: required from ‘struct Eigen::internal::general_matrix_vector_product, 1, false, double, Eigen::internal::const_blas_data_mapper, false, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:347:132: required from ‘static void Eigen::internal::gemv_dense_selector<2, 1, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose >; Rhs = Eigen::Block, -1, 1, true>; Dest = Eigen::Block, -1, 1, true>; typename Dest::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block, -1, 1, true>; Lhs = Eigen::Transpose >; Rhs = const Eigen::Block, -1, 1, true>; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 52 | unpacket_traits<_RhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1 | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 59 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 60 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 61 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:314:45: required from ‘struct Eigen::internal::general_matrix_vector_product, 1, false, double, Eigen::internal::const_blas_data_mapper, false, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:347:132: required from ‘static void Eigen::internal::gemv_dense_selector<2, 1, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose >; Rhs = Eigen::Block, -1, 1, true>; Dest = Eigen::Block, -1, 1, true>; typename Dest::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block, -1, 1, true>; Lhs = Eigen::Transpose >; Rhs = const Eigen::Block, -1, 1, true>; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 52 | unpacket_traits<_RhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1 | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 59 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 60 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 61 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, 1, -1, false>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true> >, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl >, 1, -1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:43: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:56: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>; U = Eigen::Block, -1, 1, true>, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true> >, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl >, 1, -1, true>, 1, -1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:23: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:56: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>, 1, -1, true>; U = Eigen::Block, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false> >, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:330: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:147:40: required from ‘void Eigen::internal::evaluateProductBlockingSizesHeuristic(Index&, Index&, Index&, Index) [with LhsScalar = double; RhsScalar = double; int KcFactor = 1; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:342:81: required from ‘void Eigen::internal::computeProductBlockingSizes(Index&, Index&, Index&, Index) [with LhsScalar = double; RhsScalar = double; int KcFactor = 1; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:355:66: required from ‘Eigen::internal::gemm_blocking_space::gemm_blocking_space(Eigen::Index, Eigen::Index, Eigen::Index, Eigen::Index, bool) [with int StorageOrder = 0; _LhsScalar = double; _RhsScalar = double; int MaxRows = -1; int MaxCols = -1; int MaxDepth = -1; int KcFactor = 1; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:507:18: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 460 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 461 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 462 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 465 | typedef QuadPacket RhsPacketx4; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1080:42: required from ‘struct Eigen::internal::gebp_kernel, 4, 4, false, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:82:107: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 460 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 461 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 462 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 465 | typedef QuadPacket RhsPacketx4; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1085:45: required from ‘struct Eigen::internal::gebp_kernel, 4, 4, false, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:82:107: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 460 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 461 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 462 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 465 | typedef QuadPacket RhsPacketx4; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gemm_pack_lhs::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long int; DataMapper = Eigen::internal::const_blas_data_mapper; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:184:17: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/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::half>::half QuarterPacket; | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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::size, | ^~~~ /home/omnipath/local/R/4.5-3.21/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::size, | ^~~~ /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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 kernel_half; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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 kernel_quarter; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gemm_pack_rhs::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long int; DataMapper = Eigen::internal::const_blas_data_mapper; int nr = 4; bool Conjugate = false; bool PanelMode = false]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:195:21: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2459:62: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 2459 | PacketBlock kernel; | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gebp_kernel::operator()(const DataMapper&, const LhsScalar*, const RhsScalar*, Index, Index, Index, ResScalar, Index, Index, Index, Index) [with LhsScalar = double; RhsScalar = double; Index = long int; DataMapper = Eigen::internal::blas_data_mapper; int mr = 4; int nr = 4; bool ConjugateLhs = false; bool ConjugateRhs = false; ResScalar = double]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:198:15: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/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::half>::size; | ^~~~ /home/omnipath/local/R/4.5-3.21/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::half>::half>::size; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1921:138: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SResPacket>::type SResPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SLhsPacket>::type SLhsPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SRhsPacket>::type SRhsPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SAccPacket>::type SAccPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true>, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:78: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41: required from ‘struct Eigen::internal::unary_evaluator >, 1, -1, true>, 1, -1, true> >, Eigen::internal::IndexBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:52: required from ‘const Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::CoeffReturnType Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::coeff(Eigen::Index, Eigen::Index) const [with Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; int ProductTag = 8; typename Eigen::internal::traits::Lhs>::Scalar = double; typename Eigen::Product::Lhs = Eigen::Transpose >; typename Eigen::internal::traits::Rhs>::Scalar = double; typename Eigen::Product::Rhs = Eigen::Matrix; CoeffReturnType = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:63: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>; U = Eigen::Block, -1, 1, true>, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: required from ‘typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType Eigen::MatrixBase::dot(const Eigen::MatrixBase&) const [with OtherDerived = Eigen::Block, -1, 1, true>, -1, 1, true>; Derived = Eigen::Block >, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType = double; typename Eigen::internal::traits::Scalar = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:63: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>, 1, -1, true>; U = Eigen::Block, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: required from ‘typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType Eigen::MatrixBase::dot(const Eigen::MatrixBase&) const [with OtherDerived = Eigen::Block, -1, 1, true>; Derived = Eigen::Block >, 1, -1, true>, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType = double; typename Eigen::internal::traits::Scalar = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:75: required from ‘const Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::CoeffReturnType Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::coeff(Eigen::Index, Eigen::Index) const [with Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; int ProductTag = 8; typename Eigen::internal::traits::Lhs>::Scalar = double; typename Eigen::Product::Lhs = Eigen::Transpose >; typename Eigen::internal::traits::Rhs>::Scalar = double; typename Eigen::Product::Rhs = Eigen::Matrix; CoeffReturnType = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63: required from ‘void Eigen::internal::generic_dense_assignment_kernel::assignCoeff(Eigen::Index, Eigen::Index) [with DstEvaluatorTypeT = Eigen::internal::evaluator >; SrcEvaluatorTypeT = Eigen::internal::evaluator >, Eigen::Matrix, 1> >; Functor = Eigen::internal::assign_op; int Version = 1; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:668:16: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::Block, -1, 1, true>; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Block, -1, 1, true>; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, -1, 1, true> >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum::operator()(const XprType&) const [with XprType = Eigen::Block, -1, 1, true>; ResultType = double; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator >::Scalar Eigen::internal::evaluator >::coeff(Eigen::Index) const [with ArgType = Eigen::Matrix; MemberOp = Eigen::internal::member_sum; int Direction = 0; Scalar = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:775:40: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/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::value), void*>::type) [with Dst = Eigen::Matrix; Src = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix; Src = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32: required from ‘Derived& Eigen::PlainObjectBase::_set(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fast_NN_dist.cpp -o fast_NN_dist.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c integration.cpp -o integration.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from integration.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ integration.cpp:23:1: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ integration.cpp:23:1: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ integration.cpp:23:1: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, 1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, 1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, 1, -1, false>’ integration.cpp:43:41: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ integration.cpp:60:53: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ integration.cpp:60:79: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>’ integration.cpp:60:99: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ integration.cpp:68:61: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::internal::member_sum, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:56:7: required from ‘class Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>’ integration.cpp:77:57: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseView.h:45:7: required from ‘class Eigen::SparseView >’ integration.cpp:83:41: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >, Eigen::SparseMatrix, 2> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:145:7: required from ‘class Eigen::ProductImpl >, Eigen::SparseMatrix, 2, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::SparseMatrix, 2>’ integration.cpp:94:85: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCwiseBinaryOp.h:36:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2>, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> >’ integration.cpp:94:85: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, -1, 1, true, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, 1, true>’ integration.cpp:140:36: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >’ integration.cpp:140:60: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCwiseBinaryOp.h:64:51: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> >, Eigen::internal::IteratorBased, Eigen::internal::IteratorBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ integration.cpp:94:85: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1126:103: required from ‘void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&, DupFunctor) [with InputIterators = __gnu_cxx::__normal_iterator*, std::vector > >; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::; _Scalar = double; int _Options = 0; _StorageIndex = int]’ integration.cpp:59:33: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:40: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ integration.cpp:140:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1126:103: required from ‘void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&, DupFunctor) [with InputIterators = __gnu_cxx::__normal_iterator*, std::vector > >; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::; _Scalar = double; int _Options = 0; _StorageIndex = int]’ integration.cpp:59:33: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:883:17: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Matrix; Src = Eigen::Block, 1, -1, false>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:43:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:277: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:46: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ integration.cpp:140:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, 1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/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::Transpose >; SrcXprType = Eigen::Block, 1, -1, false>; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::Block, 1, -1, false>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::Block, 1, -1, false>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:43:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:46: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ integration.cpp:140:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::PartialReduxExpr, member_sum, 0>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:77:58: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum::operator()(const XprType&) const [with XprType = Eigen::Block, -1, 1, true>; ResultType = double; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator >::Scalar Eigen::internal::evaluator >::coeff(Eigen::Index) const [with ArgType = Eigen::Matrix; MemberOp = Eigen::internal::member_sum; int Direction = 0; Scalar = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::PartialReduxExpr, member_sum, 0>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:77:58: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::Block, -1, 1, true>; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Block, -1, 1, true>; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, -1, 1, true> >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum::operator()(const XprType&) const [with XprType = Eigen::Block, -1, 1, true>; ResultType = double; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator >::Scalar Eigen::internal::evaluator >::coeff(Eigen::Index) const [with ArgType = Eigen::Matrix; MemberOp = Eigen::internal::member_sum; int Direction = 0; Scalar = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::PartialReduxExpr, member_sum, 0>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:77:58: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c snn.cpp -o snn.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from snn.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ snn.cpp:16:79: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ snn.cpp:16:79: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ snn.cpp:27:29: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, Eigen::Transpose >, 2> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:145:7: required from ‘class Eigen::ProductImpl, Eigen::Transpose >, 2, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product, Eigen::Transpose >, 2>’ snn.cpp:27:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, 1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, 1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, 1, -1, false>’ snn.cpp:106:30: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >’ snn.cpp:106:48: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ snn.cpp:26:22: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:40: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ snn.cpp:106:55: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ snn.cpp:26:22: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseUtil.h:121:8: required from ‘struct Eigen::internal::plain_object_eval, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseProduct.h:71:53: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dest&, const Lhs&, const Rhs&, Eigen::SparseShape) [with Dest = Eigen::SparseMatrix; Lhs = Eigen::SparseMatrix; Rhs = Eigen::Transpose >; int ProductType = 8]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseProduct.h:43:11: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dest&, const Lhs&, const Rhs&) [with Dest = Eigen::SparseMatrix; Lhs = Eigen::SparseMatrix; Rhs = Eigen::Transpose >; int ProductType = 8]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseProduct.h:174:51: required from ‘Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::Product&) [with Lhs = Eigen::SparseMatrix; Rhs = Eigen::Transpose >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ snn.cpp:27:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:277: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, 1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:46: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ snn.cpp:106:55: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stats.cpp -o stats.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c valid_pointer.c -o valid_pointer.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o Seurat.so ModularityOptimizer.o RModularityOptimizer.o RcppExports.o data_manipulation.o fast_NN_dist.o integration.o snn.o stats.o valid_pointer.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-Seurat/00new/Seurat/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading Error: package or namespace load failed for ‘SeuratObject’ in dyn.load(file, DLLpath = DLLpath, ...): unable to load shared object '/home/omnipath/local/R/4.5-3.21/spam/libs/spam.so': libRblas.so: cannot open shared object file: No such file or directory Execution halted ERROR: lazy loading failed for package ‘Seurat’ * removing ‘/home/omnipath/local/R/4.5-3.21/Seurat’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/Seurat’ The downloaded source packages are in ‘/tmp/RtmpAMOq6W/downloaded_packages’ Warning messages: 1: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘emmeans’ had non-zero exit status 2: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘ggtree’ had non-zero exit status 3: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘GSVA’ had non-zero exit status 4: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘SeuratObject’ had non-zero exit status 5: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘enrichplot’ had non-zero exit status 6: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘Seurat’ had non-zero exit status 'getOption("repos")' replaces Bioconductor standard repositories, see 'help("repositories", package = "BiocManager")' for details. Replacement repositories: CRAN: https://cloud.r-project.org Bioconductor version 3.21 (BiocManager 1.30.26), R 4.5.1 (2025-06-13) Old packages: 'emmeans', 'enrichplot', 'ggtree', 'GSVA', 'Seurat', 'SeuratObject' trying URL 'https://cloud.r-project.org/src/contrib/emmeans_2.0.0.tar.gz' trying URL 'https://bioconductor.org/packages/3.21/bioc/src/contrib/enrichplot_1.28.4.tar.gz' trying URL 'https://bioconductor.org/packages/3.21/bioc/src/contrib/ggtree_3.16.3.tar.gz' trying URL 'https://bioconductor.org/packages/3.21/bioc/src/contrib/GSVA_2.2.1.tar.gz' trying URL 'https://cloud.r-project.org/src/contrib/Seurat_5.3.1.tar.gz' trying URL 'https://cloud.r-project.org/src/contrib/SeuratObject_5.2.0.tar.gz' * installing *source* package ‘emmeans’ ... ** this is package ‘emmeans’ version ‘2.0.0’ ** package ‘emmeans’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/mvtnorm/libs/mvtnorm.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... namespaceImport -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘emmeans’ * removing ‘/home/omnipath/local/R/4.5-3.21/emmeans’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/emmeans’ * installing *source* package ‘ggtree’ ... ** this is package ‘ggtree’ version ‘3.16.3’ ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/ape/libs/ape.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... asNamespace -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘ggtree’ * removing ‘/home/omnipath/local/R/4.5-3.21/ggtree’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/ggtree’ * installing *source* package ‘GSVA’ ... ** this is package ‘GSVA’ version ‘2.2.1’ ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ecdfvals.c -o ecdfvals.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c kcdfvals.c -o kcdfvals.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c kernel_estimation.c -o kernel_estimation.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ks_test.c -o ks_test.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c register_cmethods.c -o register_cmethods.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/cli/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -std=gnu2x -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o GSVA.so ecdfvals.o kcdfvals.o kernel_estimation.o ks_test.o register_cmethods.o utils.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-GSVA/00new/GSVA/libs ** R ** inst ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/irlba/libs/irlba.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... asNamespace -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘GSVA’ * removing ‘/home/omnipath/local/R/4.5-3.21/GSVA’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/GSVA’ * installing *source* package ‘SeuratObject’ ... ** this is package ‘SeuratObject’ version ‘5.2.0’ ** package ‘SeuratObject’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ using C++ compiler: ‘g++ (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RcppExports.cpp -o RcppExports.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from RcppExports.cpp:4: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:77:20: required from ‘void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix; Functor = Eigen::internal::assign_op; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/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::SparseMatrix; Src = Eigen::SparseMatrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:713:13: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenWrap.h:387:24: required from ‘Eigen::SparseMatrix Rcpp::traits::Exporter >::get() [with T = double]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:89:32: required from ‘T Rcpp::internal::as(SEXP, Rcpp::traits::r_type_generic_tag) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/InputParameter.h:34:43: required from ‘Rcpp::InputParameter::operator T() [with T = Eigen::SparseMatrix]’ RcppExports.cpp:20:55: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c data_manipulation.cpp -o data_manipulation.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from data_manipulation.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:27:22: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:33:26: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:33:26: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ data_manipulation.cpp:83:80: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:58:63: required from ‘struct Eigen::internal::unary_evaluator >, Eigen::internal::IteratorBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::Transpose >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:27:23: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:111:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c valid_pointer.c -o valid_pointer.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o SeuratObject.so RcppExports.o data_manipulation.o valid_pointer.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-SeuratObject/00new/SeuratObject/libs ** R ** data *** moving datasets to lazyload DB ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/spam/libs/spam.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... asNamespace -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘SeuratObject’ * removing ‘/home/omnipath/local/R/4.5-3.21/SeuratObject’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/SeuratObject’ * installing *source* package ‘enrichplot’ ... ** this is package ‘enrichplot’ version ‘1.28.4’ ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading Error in dyn.load(file, DLLpath = DLLpath, ...) : unable to load shared object '/home/omnipath/local/R/4.5-3.21/ape/libs/ape.so': libRblas.so: cannot open shared object file: No such file or directory Calls: ... asNamespace -> loadNamespace -> library.dynam -> dyn.load Execution halted ERROR: lazy loading failed for package ‘enrichplot’ * removing ‘/home/omnipath/local/R/4.5-3.21/enrichplot’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/enrichplot’ * installing *source* package ‘Seurat’ ... ** this is package ‘Seurat’ version ‘5.3.1’ ** package ‘Seurat’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ using C++ compiler: ‘g++ (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ using C++17 g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ModularityOptimizer.cpp -o ModularityOptimizer.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RModularityOptimizer.cpp -o RModularityOptimizer.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from RModularityOptimizer.cpp:9: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RcppExports.cpp -o RcppExports.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from RcppExports.cpp:4: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ RcppExports.cpp:71:105: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:18:8: required from ‘struct Eigen::internal::traits > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48: required from ‘struct Eigen::internal::accessors_level > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75: required from ‘class Eigen::Map >’ RcppExports.cpp:94:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:24:49: required from ‘struct Eigen::internal::traits > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48: required from ‘struct Eigen::internal::accessors_level > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75: required from ‘class Eigen::Map >’ RcppExports.cpp:94:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:94:79: required from ‘class Eigen::Map >’ RcppExports.cpp:94:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ RcppExports.cpp:169:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:77:20: required from ‘void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix; Functor = Eigen::internal::assign_op; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/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::SparseMatrix; Src = Eigen::SparseMatrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:713:13: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenWrap.h:387:24: required from ‘Eigen::SparseMatrix Rcpp::traits::Exporter >::get() [with T = double]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:89:32: required from ‘T Rcpp::internal::as(SEXP, Rcpp::traits::r_type_generic_tag) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/InputParameter.h:34:43: required from ‘Rcpp::InputParameter::operator T() [with T = Eigen::SparseMatrix]’ RcppExports.cpp:29:60: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:77:20: required from ‘void Eigen::internal::assign_sparse_to_sparse(DstXprType&, const SrcXprType&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseAssign.h:132:28: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Eigen::internal::assign_op&) [with DstXprType = Eigen::SparseMatrix; SrcXprType = Eigen::SparseMatrix; Functor = Eigen::internal::assign_op; typename DstXprType::Scalar = double; typename SrcXprType::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/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::SparseMatrix; Src = Eigen::SparseMatrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:713:13: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 1; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenWrap.h:412:24: required from ‘Eigen::SparseMatrix<_Scalar, 1> Rcpp::traits::Exporter >::get() [with T = double]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:89:32: required from ‘T Rcpp::internal::as(SEXP, Rcpp::traits::r_type_generic_tag) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ /home/omnipath/local/R/4.5-3.21/Rcpp/include/Rcpp/InputParameter.h:34:43: required from ‘Rcpp::InputParameter::operator T() [with T = Eigen::SparseMatrix]’ RcppExports.cpp:71:50: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c data_manipulation.cpp -o data_manipulation.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from data_manipulation.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:18:21: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:18:21: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:18:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ data_manipulation.cpp:18:71: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>’ data_manipulation.cpp:18:83: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ data_manipulation.cpp:75:127: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:24:49: required from ‘struct Eigen::internal::traits > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:32:48: required from ‘struct Eigen::internal::accessors_level > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/ForwardDeclarations.h:111:75: required from ‘class Eigen::Map >’ data_manipulation.cpp:131:88: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Map.h:94:79: required from ‘class Eigen::Map >’ data_manipulation.cpp:131:88: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:45:7: required from ‘class Eigen::Array’ data_manipulation.cpp:136:20: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl >, -1, 1, true, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block >, -1, 1, true>’ data_manipulation.cpp:136:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, -1, 1, true> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper >, -1, 1, true> >’ data_manipulation.cpp:136:40: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Array >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Array > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::Array > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, const Eigen::Array >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:138:32: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:138:32: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ data_manipulation.cpp:138:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:96:7: required from ‘class Eigen::internal::sparse_matrix_block_impl, -1, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:287:7: required from ‘class Eigen::BlockImpl, -1, 1, true, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, 1, true>’ data_manipulation.cpp:186:50: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, -1, 1, true, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, 1, true>’ data_manipulation.cpp:187:19: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper >’ data_manipulation.cpp:187:35: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:187:40: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >’ data_manipulation.cpp:187:51: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:194:30: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::internal::member_sum, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:56:7: required from ‘class Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:229:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, const Eigen::Matrix >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:229:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:229:45: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Replicate.h:61:65: required from ‘class Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ data_manipulation.cpp:231:37: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::Matrix, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::Matrix, 0, 8>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::Matrix, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::Matrix, 0>’ data_manipulation.cpp:231:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, const Eigen::Matrix >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase >, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, 1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl >, 1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block >, 1, -1, false>’ data_manipulation.cpp:368:29: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, false> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, false> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper >, 1, -1, false> >’ data_manipulation.cpp:368:38: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:58:63: required from ‘struct Eigen::internal::unary_evaluator >, Eigen::internal::IteratorBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::Transpose >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:150:23: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, -1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, -1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, -1, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CommaInitializer.h:99:21: required from ‘Eigen::CommaInitializer& Eigen::CommaInitializer::operator,(const Eigen::DenseBase&) [with OtherDerived = Eigen::Matrix; XprType = Eigen::Matrix]’ data_manipulation.cpp:249:17: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ data_manipulation.cpp:110:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, 0, Eigen::OuterStride<> > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase, 0, Eigen::OuterStride<> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMap.h:50:7: required from ‘class Eigen::SparseMapBase, 0, Eigen::OuterStride<> >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:83:34: required from ‘class Eigen::internal::SparseRefBase, 0, Eigen::OuterStride<> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:177:7: required from ‘class Eigen::Ref, 0, Eigen::OuterStride<> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:128:88: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, 0, Eigen::OuterStride<> >, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:17:7: required from ‘class Eigen::BlockImpl, 0, Eigen::OuterStride<> >, -1, 1, true, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, 0, Eigen::OuterStride<> >, -1, 1, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:194:85: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::Array; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Array; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Array; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:478:32: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::mean() const [with Derived = Eigen::Array; typename Eigen::internal::traits::Scalar = double]’ data_manipulation.cpp:137:28: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Array, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; typename Eigen::internal::traits::Scalar = double]’ data_manipulation.cpp:138:53: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:883:17: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Array; Src = Eigen::ArrayWrapper >, 1, -1, false> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:288:29: required from ‘Eigen::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const Eigen::EigenBase&, typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1; typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type = Eigen::Array::PrivateType; typename OtherDerived::Scalar = double; typename Eigen::internal::traits >::Scalar = double]’ data_manipulation.cpp:368:39: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0, Eigen::OuterStride<> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator, 0, Eigen::OuterStride<> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:364:8: required from ‘struct Eigen::internal::evaluator, 0, Eigen::OuterStride<> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:45:21: required from ‘Eigen::Index Eigen::BlockImpl::nonZeros() const [with XprType = Eigen::Ref, 0, Eigen::OuterStride<> >; int BlockRows = -1; int BlockCols = 1; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:194:97: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:277: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1384:41: required from ‘struct Eigen::internal::evaluator_wrapper_base >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1464:8: required from ‘struct Eigen::internal::unary_evaluator >, -1, 1, true> >, Eigen::internal::IndexBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator >, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/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::Array; SrcXprType = Eigen::ArrayWrapper >, -1, 1, true> >; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Array; SrcXprType = Eigen::ArrayWrapper >, -1, 1, true> >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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::Array; Src = Eigen::ArrayWrapper >, -1, 1, true> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, -1, 1, true> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, -1, 1, true> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:288:29: required from ‘Eigen::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const Eigen::EigenBase&, typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type) [with OtherDerived = Eigen::ArrayWrapper >, -1, 1, true> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1; typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type = Eigen::Array::PrivateType; typename OtherDerived::Scalar = double; typename Eigen::internal::traits >::Scalar = double]’ data_manipulation.cpp:136:41: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/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, -1, 1, true>; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block, -1, 1, true>; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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, -1, 1, true>; Src = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/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::value), void*>::type) [with Dst = Eigen::Block, -1, 1, true>; Src = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block, -1, 1, true>; Src = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Assign.h:66:28: required from ‘Derived& Eigen::MatrixBase::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::CwiseBinaryOp, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, const Eigen::CwiseNullaryOp, const Eigen::Array > >; Derived = Eigen::Block, -1, 1, true>]’ data_manipulation.cpp:187:51: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, 1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1384:41: required from ‘struct Eigen::internal::evaluator_wrapper_base >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1464:8: required from ‘struct Eigen::internal::unary_evaluator >, 1, -1, false> >, Eigen::internal::IndexBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/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::Transpose >; SrcXprType = Eigen::ArrayWrapper >, 1, -1, false> >; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::ArrayWrapper >, 1, -1, false> >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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::Array; Src = Eigen::ArrayWrapper >, 1, -1, false> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; Derived = Eigen::Array]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Array.h:288:29: required from ‘Eigen::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const Eigen::EigenBase&, typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type) [with OtherDerived = Eigen::ArrayWrapper >, 1, -1, false> >; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1; typename Eigen::internal::enable_if >::Scalar>::value, PrivateType>::type = Eigen::Array::PrivateType; typename OtherDerived::Scalar = double; typename Eigen::internal::traits >::Scalar = double]’ data_manipulation.cpp:368:39: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:549:8: required from ‘struct Eigen::internal::unary_evaluator, -1, 1, true>, Eigen::internal::IteratorBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1087:8: required from ‘struct Eigen::internal::block_evaluator, -1, 1, true, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1034:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:217:9: required from ‘void Eigen::Ref, _Options, _StrideType>::construct(const Expression&, Eigen::internal::true_type) [with Expression = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:190:16: required from ‘Eigen::Ref, _Options, _StrideType>::Ref(const Eigen::SparseMatrixBase&) [with Derived = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:128:88: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:217:9: required from ‘void Eigen::Ref, _Options, _StrideType>::construct(const Expression&, Eigen::internal::true_type) [with Expression = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseRef.h:190:16: required from ‘Eigen::Ref, _Options, _StrideType>::Ref(const Eigen::SparseMatrixBase&) [with Derived = Eigen::Block, -1, 1, true>; MatScalar = double; int MatOptions = 0; MatIndex = int; int Options = 0; StrideType = Eigen::OuterStride<>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:128:88: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::Block, -1, 1, true>; SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseBlock.h:216:34: required from ‘Eigen::internal::sparse_matrix_block_impl::BlockType& Eigen::internal::sparse_matrix_block_impl::operator=(const BlockType&) [with SparseMatrixType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; BlockType = Eigen::Block, -1, 1, true>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:111:5: required from ‘Eigen::Block& Eigen::Block::operator=(const Eigen::Block&) [with XprType = Eigen::SparseMatrix; int BlockRows = -1; int BlockCols = 1; bool InnerPanel = true]’ data_manipulation.cpp:409:42: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/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, -1, -1, false>; SrcXprType = Eigen::Matrix; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block, -1, -1, false>; SrcXprType = Eigen::Matrix; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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, -1, -1, false>; Src = Eigen::Matrix; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/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::value), void*>::type) [with Dst = Eigen::Block, -1, -1, false>; Src = Eigen::Matrix; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block, -1, -1, false>; Src = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Assign.h:66:28: required from ‘Derived& Eigen::MatrixBase::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::Matrix; Derived = Eigen::Block, -1, -1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CommaInitializer.h:99:64: required from ‘Eigen::CommaInitializer& Eigen::CommaInitializer::operator,(const Eigen::DenseBase&) [with OtherDerived = Eigen::Matrix; XprType = Eigen::Matrix]’ data_manipulation.cpp:249:17: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, const Eigen::Block, -1, 1, true>, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, const Eigen::Block, -1, 1, true>, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, const Eigen::Block, -1, 1, true>, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, const Eigen::Block, -1, 1, true>, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, const Eigen::Block, -1, 1, true>, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, const Eigen::Block, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:345:45: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:370:45: required from ‘struct Eigen::internal::generic_product_impl >, const Eigen::Block, -1, 1, true>, Eigen::DenseShape, Eigen::DenseShape, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, Eigen::Matrix, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true>, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true>, Eigen::Matrix, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, 1, -1, true>, Eigen::Matrix, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, 1, -1, true>, Eigen::Matrix, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, 1, -1, true>, Eigen::Matrix, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:345:45: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 1, -1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, 1, -1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, 1, -1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval >, 1, -1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45: required from ‘struct Eigen::internal::generic_product_impl >, 1, -1, true>, Eigen::Matrix, Eigen::DenseShape, Eigen::DenseShape, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:486:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::Matrix, 1>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::Matrix, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::Matrix, 1> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::Matrix, 1, 8>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::Matrix, 1, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::Matrix, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:462:68: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:347:30: required from ‘Derived& Eigen::DenseBase::setConstant(const Scalar&) [with Derived = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:548:10: required from ‘Derived& Eigen::DenseBase::setZero() [with Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:444:18: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true>, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase >, 1, -1, true>, 1, -1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense >, 1, -1, true>, 1, -1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0, Eigen::Stride<0, 0> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 0, Eigen::Stride<0, 0> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 0, Eigen::Stride<0, 0> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 0, Eigen::Stride<0, 0> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 0, Eigen::Stride<0, 0> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 0, Eigen::Stride<0, 0> >, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:333: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:306:38: required from ‘struct Eigen::internal::general_matrix_vector_product, 1, false, double, Eigen::internal::const_blas_data_mapper, false, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:347:132: required from ‘static void Eigen::internal::gemv_dense_selector<2, 1, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose >; Rhs = Eigen::Block, -1, 1, true>; Dest = Eigen::Block, -1, 1, true>; typename Dest::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block, -1, 1, true>; Lhs = Eigen::Transpose >; Rhs = const Eigen::Block, -1, 1, true>; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 52 | unpacket_traits<_RhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1 | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 59 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 60 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 61 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:310:42: required from ‘struct Eigen::internal::general_matrix_vector_product, 1, false, double, Eigen::internal::const_blas_data_mapper, false, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:347:132: required from ‘static void Eigen::internal::gemv_dense_selector<2, 1, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose >; Rhs = Eigen::Block, -1, 1, true>; Dest = Eigen::Block, -1, 1, true>; typename Dest::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block, -1, 1, true>; Lhs = Eigen::Transpose >; Rhs = const Eigen::Block, -1, 1, true>; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 52 | unpacket_traits<_RhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1 | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 59 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 60 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 61 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:314:45: required from ‘struct Eigen::internal::general_matrix_vector_product, 1, false, double, Eigen::internal::const_blas_data_mapper, false, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:347:132: required from ‘static void Eigen::internal::gemv_dense_selector<2, 1, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose >; Rhs = Eigen::Block, -1, 1, true>; Dest = Eigen::Block, -1, 1, true>; typename Dest::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block, -1, 1, true>; Lhs = Eigen::Transpose >; Rhs = const Eigen::Block, -1, 1, true>; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 42 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 52 | unpacket_traits<_RhsPacket>::vectorizable && | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size), | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1 | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 59 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 60 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 61 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, 1, -1, false>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true> >, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl >, 1, -1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:43: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:56: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>; U = Eigen::Block, -1, 1, true>, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase >, 1, -1, true>, 1, -1, true> >, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl >, 1, -1, true>, 1, -1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:23: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:56: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>, 1, -1, true>; U = Eigen::Block, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false> >, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false> >, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:330: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:147:40: required from ‘void Eigen::internal::evaluateProductBlockingSizesHeuristic(Index&, Index&, Index&, Index) [with LhsScalar = double; RhsScalar = double; int KcFactor = 1; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:342:81: required from ‘void Eigen::internal::computeProductBlockingSizes(Index&, Index&, Index&, Index) [with LhsScalar = double; RhsScalar = double; int KcFactor = 1; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:355:66: required from ‘Eigen::internal::gemm_blocking_space::gemm_blocking_space(Eigen::Index, Eigen::Index, Eigen::Index, Eigen::Index, bool) [with int StorageOrder = 0; _LhsScalar = double; _RhsScalar = double; int MaxRows = -1; int MaxCols = -1; int MaxDepth = -1; int KcFactor = 1; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:507:18: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 460 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 461 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 462 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 465 | typedef QuadPacket RhsPacketx4; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1080:42: required from ‘struct Eigen::internal::gebp_kernel, 4, 4, false, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:82:107: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 460 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 461 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 462 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 465 | typedef QuadPacket RhsPacketx4; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1085:45: required from ‘struct Eigen::internal::gebp_kernel, 4, 4, false, false>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:82:107: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] 427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize); | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’ 384 | prefix ## name ## Packet | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable, | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1, | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 460 | typedef typename conditional::type LhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 461 | typedef typename conditional::type RhsPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 462 | typedef typename conditional::type ResPacket; | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] 465 | typedef QuadPacket RhsPacketx4; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gemm_pack_lhs::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long int; DataMapper = Eigen::internal::const_blas_data_mapper; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:184:17: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/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::half>::half QuarterPacket; | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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::size, | ^~~~ /home/omnipath/local/R/4.5-3.21/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::size, | ^~~~ /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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 kernel_half; | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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 kernel_quarter; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/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] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gemm_pack_rhs::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long int; DataMapper = Eigen::internal::const_blas_data_mapper; int nr = 4; bool Conjugate = false; bool PanelMode = false]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:195:21: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2459:62: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 2459 | PacketBlock kernel; | ^~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gebp_kernel::operator()(const DataMapper&, const LhsScalar*, const RhsScalar*, Index, Index, Index, ResScalar, Index, Index, Index, Index) [with LhsScalar = double; RhsScalar = double; Index = long int; DataMapper = Eigen::internal::blas_data_mapper; int mr = 4; int nr = 4; bool ConjugateLhs = false; bool ConjugateRhs = false; ResScalar = double]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:198:15: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 1; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Transpose >, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:445:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/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::half>::size; | ^~~~ /home/omnipath/local/R/4.5-3.21/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::half>::half>::size; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1921:138: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SResPacket>::type SResPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SLhsPacket>::type SLhsPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SRhsPacket>::type SRhsPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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=8,typename unpacket_traits::half,SAccPacket>::type SAccPacketHalf; | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true>, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true>, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:78: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41: required from ‘struct Eigen::internal::unary_evaluator >, 1, -1, true>, 1, -1, true> >, Eigen::internal::IndexBased, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >, 1, -1, true>, 1, -1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:52: required from ‘const Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::CoeffReturnType Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::coeff(Eigen::Index, Eigen::Index) const [with Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; int ProductTag = 8; typename Eigen::internal::traits::Lhs>::Scalar = double; typename Eigen::Product::Lhs = Eigen::Transpose >; typename Eigen::internal::traits::Rhs>::Scalar = double; typename Eigen::Product::Rhs = Eigen::Matrix; CoeffReturnType = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:63: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>; U = Eigen::Block, -1, 1, true>, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: required from ‘typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType Eigen::MatrixBase::dot(const Eigen::MatrixBase&) const [with OtherDerived = Eigen::Block, -1, 1, true>, -1, 1, true>; Derived = Eigen::Block >, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType = double; typename Eigen::internal::traits::Scalar = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true>, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:50:63: required from ‘static Eigen::internal::dot_nocheck::ResScalar Eigen::internal::dot_nocheck::run(const Eigen::MatrixBase&, const Eigen::MatrixBase&) [with T = Eigen::Block >, 1, -1, true>, 1, -1, true>; U = Eigen::Block, -1, 1, true>; ResScalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: required from ‘typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType Eigen::MatrixBase::dot(const Eigen::MatrixBase&) const [with OtherDerived = Eigen::Block, -1, 1, true>; Derived = Eigen::Block >, 1, -1, true>, 1, -1, true>; typename Eigen::ScalarBinaryOpTraits::Scalar, typename Eigen::internal::traits::Scalar>::ReturnType = double; typename Eigen::internal::traits::Scalar = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:380:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose >, 1, -1, true> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:75: required from ‘const Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::CoeffReturnType Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::coeff(Eigen::Index, Eigen::Index) const [with Lhs = Eigen::Transpose >; Rhs = Eigen::Matrix; int ProductTag = 8; typename Eigen::internal::traits::Lhs>::Scalar = double; typename Eigen::Product::Lhs = Eigen::Transpose >; typename Eigen::internal::traits::Rhs>::Scalar = double; typename Eigen::Product::Rhs = Eigen::Matrix; CoeffReturnType = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63: required from ‘void Eigen::internal::generic_dense_assignment_kernel::assignCoeff(Eigen::Index, Eigen::Index) [with DstEvaluatorTypeT = Eigen::internal::evaluator >; SrcEvaluatorTypeT = Eigen::internal::evaluator >, Eigen::Matrix, 1> >; Functor = Eigen::internal::assign_op; int Version = 1; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:668:16: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Product >, Eigen::Matrix, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:231:70: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::Block, -1, 1, true>; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Block, -1, 1, true>; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, -1, 1, true> >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum::operator()(const XprType&) const [with XprType = Eigen::Block, -1, 1, true>; ResultType = double; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator >::Scalar Eigen::internal::evaluator >::coeff(Eigen::Index) const [with ArgType = Eigen::Matrix; MemberOp = Eigen::internal::member_sum; int Direction = 0; Scalar = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:775:40: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/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::value), void*>::type) [with Dst = Eigen::Matrix; Src = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix; Src = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:779:32: required from ‘Derived& Eigen::PlainObjectBase::_set(const Eigen::DenseBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Replicate, const Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>, const Eigen::CwiseNullaryOp, const Eigen::Matrix > >, -1, 1> >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ data_manipulation.cpp:229:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fast_NN_dist.cpp -o fast_NN_dist.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c integration.cpp -o integration.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from integration.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ integration.cpp:23:1: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ integration.cpp:23:1: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ integration.cpp:23:1: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, 1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, 1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, 1, -1, false>’ integration.cpp:43:41: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ integration.cpp:60:53: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ integration.cpp:60:79: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, 7>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::CwiseNullaryOp, Eigen::Matrix >, 0>’ integration.cpp:60:99: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::Matrix >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::Matrix > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp, Eigen::Matrix >’ integration.cpp:68:61: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, Eigen::internal::member_sum, 0>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, Eigen::internal::member_sum, 0> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:56:7: required from ‘class Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>’ integration.cpp:77:57: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseView.h:45:7: required from ‘class Eigen::SparseView >’ integration.cpp:83:41: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >, Eigen::SparseMatrix, 2> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:145:7: required from ‘class Eigen::ProductImpl >, Eigen::SparseMatrix, 2, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product >, Eigen::SparseMatrix, 2>’ integration.cpp:94:85: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCwiseBinaryOp.h:36:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2>, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> >’ integration.cpp:94:85: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, -1, 1, true>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, -1, 1, true, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, -1, 1, true>’ integration.cpp:140:36: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >’ integration.cpp:140:60: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCwiseBinaryOp.h:64:51: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> >, Eigen::internal::IteratorBased, Eigen::internal::IteratorBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:687:97: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::SparseMatrix(const Eigen::SparseMatrixBase&) [with OtherDerived = Eigen::CwiseBinaryOp, const Eigen::SparseMatrix, const Eigen::Product >, Eigen::SparseMatrix, 2> >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ integration.cpp:94:85: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1126:103: required from ‘void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&, DupFunctor) [with InputIterators = __gnu_cxx::__normal_iterator*, std::vector > >; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::; _Scalar = double; int _Options = 0; _StorageIndex = int]’ integration.cpp:59:33: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:40: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ integration.cpp:140:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1126:103: required from ‘void Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::setFromTriplets(const InputIterators&, const InputIterators&, DupFunctor) [with InputIterators = __gnu_cxx::__normal_iterator*, std::vector > >; DupFunctor = FindWeightsC(Rcpp::NumericVector, Eigen::MatrixXd, std::vector >, std::vector >, Eigen::MatrixXd, Eigen::VectorXd, double, double, bool)::; _Scalar = double; int _Options = 0; _StorageIndex = int]’ integration.cpp:59:33: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase >, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase >, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:883:17: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Matrix; Src = Eigen::Block, 1, -1, false>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:43:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:277: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:46: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ integration.cpp:140:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, 1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/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::Transpose >; SrcXprType = Eigen::Block, 1, -1, false>; Functor = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::Block, 1, -1, false>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::Block, 1, -1, false>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::Block, 1, -1, false>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:43:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > > >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:46: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, -1, 1, true>, const Eigen::Block, -1, 1, true> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ integration.cpp:140:67: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase, -1, 1, true>, 2>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, -1, 1, true>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, -1, 1, true, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::PartialReduxExpr, member_sum, 0>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:77:58: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, -1, 1, true> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, -1, 1, true> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum::operator()(const XprType&) const [with XprType = Eigen::Block, -1, 1, true>; ResultType = double; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator >::Scalar Eigen::internal::evaluator >::coeff(Eigen::Index) const [with ArgType = Eigen::Matrix; MemberOp = Eigen::internal::member_sum; int Direction = 0; Scalar = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::PartialReduxExpr, member_sum, 0>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:77:58: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase&) [with Derived = Eigen::Block, -1, 1, true>; Eigen::Index = long int]’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl::Scalar Eigen::internal::redux_impl::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Block, -1, 1, true>; Func = Eigen::internal::scalar_sum_op; Evaluator = Eigen::internal::redux_evaluator, -1, 1, true> >; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::Block, -1, 1, true>; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum::operator()(const XprType&) const [with XprType = Eigen::Block, -1, 1, true>; ResultType = double; Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator >::Scalar Eigen::internal::evaluator >::coeff(Eigen::Index) const [with ArgType = Eigen::Matrix; MemberOp = Eigen::internal::member_sum; int Direction = 0; Scalar = double; Eigen::Index = long int]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:660:61: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Transpose >; SrcXprType = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Functor = Eigen::internal::assign_op; Weak = void]’ /home/omnipath/local/R/4.5-3.21/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; Src = Eigen::PartialReduxExpr, member_sum, 0>; Func = assign_op]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:797:41: required from ‘Derived& Eigen::PlainObjectBase::_set_noalias(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:594:19: required from ‘Eigen::PlainObjectBase::PlainObjectBase(const Eigen::DenseBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; Derived = Eigen::Matrix]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:423:29: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const Eigen::EigenBase&) [with OtherDerived = Eigen::PartialReduxExpr, Eigen::internal::member_sum, 0>; _Scalar = double; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ integration.cpp:77:58: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 654 | return internal::first_aligned::alignment),Derived>(m); | ^~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c snn.cpp -o snn.o In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:205, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Dense:1, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:28, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigen.h:25, from snn.cpp:1: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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 { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ /home/omnipath/local/R/4.5-3.21/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& kernel) { | ^ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:174: /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 { \ | ^ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:165: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:271: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/SparseCore:37, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Sparse:26, from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/RcppEigenForward.h:29: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ snn.cpp:16:79: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 190 | bool Stop = Size==Dynamic || (Size%unpacket_traits::size)==0 || is_same::half>::value> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 208 | typedef typename find_best_packet_helper::type>::type type; | ^~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ snn.cpp:16:79: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase > >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:22:9: required from ‘class Eigen::internal::SparseTransposeImpl, 1024>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseTranspose.h:45:37: required from ‘class Eigen::TransposeImpl, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose >’ snn.cpp:27:29: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase, Eigen::Transpose >, 2> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:145:7: required from ‘class Eigen::ProductImpl, Eigen::Transpose >, 2, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product, Eigen::Transpose >, 2>’ snn.cpp:27:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 1, -1, false>, 3>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase, 1, -1, false>, 0>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: required from ‘class Eigen::MapBase, 1, -1, false>, 1>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense, 1, -1, false, true>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl, 1, -1, false, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block, 1, -1, false>’ snn.cpp:106:30: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false>, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >’ snn.cpp:106:48: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ snn.cpp:26:22: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 47 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >, Eigen::Dense>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:40: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ snn.cpp:106:55: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 56 | >::type PacketReturnType; | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/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&) [with OtherDerived = Eigen::SparseMatrix; _Scalar = double; int _Options = 0; _StorageIndex = int]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; SparseMatrixType = Eigen::SparseMatrix; DupFunctor = scalar_sum_op]’ /home/omnipath/local/R/4.5-3.21/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*, std::vector > >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ snn.cpp:26:22: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseUtil.h:121:8: required from ‘struct Eigen::internal::plain_object_eval, Eigen::Sparse>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseProduct.h:71:53: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dest&, const Lhs&, const Rhs&, Eigen::SparseShape) [with Dest = Eigen::SparseMatrix; Lhs = Eigen::SparseMatrix; Rhs = Eigen::Transpose >; int ProductType = 8]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseProduct.h:43:11: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dest&, const Lhs&, const Rhs&) [with Dest = Eigen::SparseMatrix; Lhs = Eigen::SparseMatrix; Rhs = Eigen::Transpose >; int ProductType = 8]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/SparseCore/SparseProduct.h:174:51: required from ‘Eigen::SparseMatrix<_Scalar, _Options, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::Product&) [with Lhs = Eigen::SparseMatrix; Rhs = Eigen::Transpose >; _Scalar = double; int _Options = 0; _StorageIndex = int]’ snn.cpp:27:31: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] In file included from /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/Core:277: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator, 1, -1, false> >’: /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, 1, -1, false> >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > > >’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> > >; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:98:46: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::squaredNorm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/Dot.h:110:23: required from ‘typename Eigen::NumTraits::Scalar>::Real Eigen::MatrixBase::norm() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Block, 1, -1, false>, const Eigen::Block, 1, -1, false> >; typename Eigen::NumTraits::Scalar>::Real = double; typename Eigen::internal::traits::Scalar = double]’ snn.cpp:106:55: required from here /home/omnipath/local/R/4.5-3.21/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits::type’ {aka ‘__m128d’} [-Wignored-attributes] 1071 | PacketAlignment = unpacket_traits::alignment, | ^~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stats.cpp -o stats.o gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/Rcpp/include' -I'/home/omnipath/local/R/4.5-3.21/RcppEigen/include' -I'/home/omnipath/local/R/4.5-3.21/RcppProgress/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c valid_pointer.c -o valid_pointer.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o Seurat.so ModularityOptimizer.o RModularityOptimizer.o RcppExports.o data_manipulation.o fast_NN_dist.o integration.o snn.o stats.o valid_pointer.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-Seurat/00new/Seurat/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading Error: package or namespace load failed for ‘SeuratObject’ in dyn.load(file, DLLpath = DLLpath, ...): unable to load shared object '/home/omnipath/local/R/4.5-3.21/spam/libs/spam.so': libRblas.so: cannot open shared object file: No such file or directory Execution halted ERROR: lazy loading failed for package ‘Seurat’ * removing ‘/home/omnipath/local/R/4.5-3.21/Seurat’ * restoring previous ‘/home/omnipath/local/R/4.5-3.21/Seurat’ The downloaded source packages are in ‘/tmp/RtmpAMOq6W/downloaded_packages’ Warning messages: 1: package(s) not installed when version(s) same as or greater than current; use `force = TRUE` to re-install: 'BiocCheck' 2: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘emmeans’ had non-zero exit status 3: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘ggtree’ had non-zero exit status 4: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘GSVA’ had non-zero exit status 5: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘SeuratObject’ had non-zero exit status 6: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘enrichplot’ had non-zero exit status 7: In install.packages(update[instlib == l, "Package"], l, contriburl = contriburl, : installation of package ‘Seurat’ had non-zero exit status BiocGenerics (0.54.1 -> 0.56.0) [CRAN] graph (1.86.0 -> 1.88.0) [CRAN] Rgraphviz (2.52.0 -> 2.54.0) [CRAN] RBGL (1.84.0 -> 1.86.0) [CRAN] Skipping 1 packages ahead of CRAN: xfun Installing 4 packages: BiocGenerics, graph, Rgraphviz, RBGL trying URL 'https://bioconductor.org/packages/3.22/bioc/src/contrib/BiocGenerics_0.56.0.tar.gz' trying URL 'https://bioconductor.org/packages/3.22/bioc/src/contrib/graph_1.88.0.tar.gz' trying URL 'https://bioconductor.org/packages/3.22/bioc/src/contrib/Rgraphviz_2.54.0.tar.gz' trying URL 'https://bioconductor.org/packages/3.22/bioc/src/contrib/RBGL_1.86.0.tar.gz' * installing *source* package ‘BiocGenerics’ ... ** this is package ‘BiocGenerics’ version ‘0.56.0’ ** package ‘BiocGenerics’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading Creating a new generic function for ‘aperm’ in package ‘BiocGenerics’ Creating a new generic function for ‘append’ in package ‘BiocGenerics’ Creating a new generic function for ‘as.data.frame’ in package ‘BiocGenerics’ Creating a new generic function for ‘cbind’ in package ‘BiocGenerics’ Creating a new generic function for ‘rbind’ in package ‘BiocGenerics’ Creating a new generic function for ‘do.call’ in package ‘BiocGenerics’ Creating a new generic function for ‘duplicated’ in package ‘BiocGenerics’ Creating a new generic function for ‘anyDuplicated’ in package ‘BiocGenerics’ Creating a new generic function for ‘eval’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmax’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmin’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmax.int’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmin.int’ in package ‘BiocGenerics’ Creating a new generic function for ‘Reduce’ in package ‘BiocGenerics’ Creating a new generic function for ‘Filter’ in package ‘BiocGenerics’ Creating a new generic function for ‘Find’ in package ‘BiocGenerics’ Creating a new generic function for ‘Map’ in package ‘BiocGenerics’ Creating a new generic function for ‘Position’ in package ‘BiocGenerics’ Creating a new generic function for ‘get’ in package ‘BiocGenerics’ Creating a new generic function for ‘mget’ in package ‘BiocGenerics’ Creating a new generic function for ‘grep’ in package ‘BiocGenerics’ Creating a new generic function for ‘grepl’ in package ‘BiocGenerics’ Creating a new generic function for ‘is.unsorted’ in package ‘BiocGenerics’ Creating a new generic function for ‘lapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘sapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘mapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘match’ in package ‘BiocGenerics’ Creating a new generic function for ‘order’ in package ‘BiocGenerics’ Creating a new generic function for ‘paste’ in package ‘BiocGenerics’ Creating a new generic function for ‘rank’ in package ‘BiocGenerics’ Creating a new generic function for ‘rownames’ in package ‘BiocGenerics’ Creating a new generic function for ‘colnames’ in package ‘BiocGenerics’ Creating a new generic function for ‘saveRDS’ in package ‘BiocGenerics’ Creating a new generic function for ‘table’ in package ‘BiocGenerics’ Creating a new generic function for ‘tapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘unique’ in package ‘BiocGenerics’ Creating a new generic function for ‘unsplit’ in package ‘BiocGenerics’ Creating a new generic function for ‘which.min’ in package ‘BiocGenerics’ Creating a new generic function for ‘which.max’ in package ‘BiocGenerics’ Creating a new generic function for ‘IQR’ in package ‘BiocGenerics’ Creating a new generic function for ‘mad’ in package ‘BiocGenerics’ Creating a new generic function for ‘var’ in package ‘BiocGenerics’ Creating a new generic function for ‘sd’ in package ‘BiocGenerics’ Creating a new generic function for ‘xtabs’ in package ‘BiocGenerics’ Creating a new generic function for ‘basename’ in package ‘BiocGenerics’ Creating a new generic function for ‘dirname’ in package ‘BiocGenerics’ ** help *** installing help indices ** building package indices ** 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 * DONE (BiocGenerics) * installing *source* package ‘graph’ ... ** this is package ‘graph’ version ‘1.88.0’ ** package ‘graph’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ gcc -std=gnu2x -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c graph.c -o graph.o gcc -std=gnu2x -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o graph.so graph.o -L/usr/lib/R/lib -lR mv graph.so BioC_graph.so installing to /home/omnipath/local/R/4.5-3.21/00LOCK-graph/00new/graph/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (graph) * installing *source* package ‘Rgraphviz’ ... ** this is package ‘Rgraphviz’ version ‘2.54.0’ ** package ‘Rgraphviz’ successfully unpacked and MD5 sums checked ** using staged installation configure: Using bundled Graphviz. configure: Searching for the compilers specified by R. checking for gcc... gcc -std=gnu17 checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc -std=gnu17 accepts -g... yes checking for gcc -std=gnu17 option to enable C11 features... none needed checking how to run the C preprocessor... gcc -std=gnu17 -E checking whether the compiler supports GNU C++... yes checking whether g++ accepts -g... yes checking for g++ option to enable C++11 features... none needed configure: Preparing to compile Graphviz. configure: Configuring bundled Graphviz. checking build system type... x86_64-pc-linux-gnu checking host system type... x86_64-pc-linux-gnu checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for a race-free mkdir -p... /usr/bin/mkdir -p checking for gawk... gawk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking for style of include used by make... GNU checking for gcc... gcc -std=gnu17 checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc -std=gnu17 accepts -g... yes checking for gcc -std=gnu17 option to enable C11 features... none needed checking dependency style of gcc -std=gnu17... gcc3 checking for library containing strerror... none required checking for flex... no checking for lex... no checking for bison... no checking for byacc... no checking for gawk... (cached) gawk checking whether ln -s works... yes checking for sed... /bin/sed checking for grep... grep checking for sort... sort checking for groff... groff checking for ps2pdf... ps2pdf checking for pstopdf... (cached) ps2pdf checking for pkg-config... /usr/bin/pkg-config checking pkg-config is at least version 0.9.0... yes checking for tclsh8.6... /usr/bin/tclsh8.6 checking whether gcc -std=gnu17 and cc understand -c and -o together... yes checking whether the compiler supports GNU C++... yes checking whether g++ accepts -g... yes checking for g++ option to enable C++11 features... none needed checking dependency style of g++... gcc3 checking for gcc... gcc checking whether the compiler supports GNU Objective C... no checking whether gcc accepts -g... no checking dependency style of gcc... gcc3 checking for inline... inline checking for windres... no checking for an ANSI C-conforming const... yes checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for sys/time.h... yes checking for mode_t... yes checking for pid_t... yes checking for size_t... yes checking for ssize_t... yes checking how to run the C preprocessor... gcc -std=gnu17 -E checking for grep that handles long lines and -e... grep checking for egrep... grep -E checking for uid_t in sys/types.h... yes checking for stdarg.h... yes checking for stddef.h... yes checking for stddef.h... (cached) yes checking for stdlib.h... (cached) yes checking for stdint.h... (cached) yes checking for malloc.h... yes checking for fcntl.h... yes checking for search.h... yes checking for getopt.h... yes checking for pthread.h... yes checking for values.h... yes checking for float.h... yes checking for limits.h... yes checking for termios.h... yes checking for errno.h... yes checking for time.h... yes checking for unistd.h... (cached) yes checking for fenv.h... yes checking for string.h... (cached) yes checking for strings.h... (cached) yes checking for inttypes.h... (cached) yes checking for setjmp.h... yes checking for sys/time.h... (cached) yes checking for sys/times.h... yes checking for sys/types.h... (cached) yes checking for sys/select.h... yes checking for fpu_control.h... yes checking for sys/fpu.h... no checking for sys/socket.h... yes checking for sys/stat.h... (cached) yes checking for sys/mman.h... yes checking for sys/ioctl.h... yes checking for sys/inotify.h... yes checking for langinfo.h... yes checking for libintl.h... yes checking for crt_externs.h... no checking for dirent.h that defines DIR... yes checking for library containing opendir... none required checking for _Bool... yes checking for stdbool.h that conforms to C99... yes checking for socklen_t... yes checking for bool... yes checking for struct dioattr... no checking for main in -lm... yes checking for feenableexcept... yes checking for fesetenv... yes checking for libgen.h... yes checking for basename in -lgen... no checking for working alloca.h... yes checking for alloca... yes checking for lrand48... yes checking for drand48... yes checking for srand48... yes checking for setmode... no checking for setenv... yes checking for getenv... yes checking for __freadable... yes checking for _sysconf... no checking for getrusage... yes checking for strerror... yes checking for cbrt... no checking for lsqrt... no checking for vsnprintf... yes checking for strtoul... yes checking for strtoll... yes checking for strtoull... yes checking for uname... yes checking for memset... yes checking for nl_langinfo... yes checking for pow... no checking for sqrt... no checking for strchr... yes checking for strdup... yes checking for strerror... (cached) yes checking for strstr... yes checking for _NSGetEnviron... no checking for strcasecmp... yes checking for strncasecmp... yes checking for strcasestr... yes checking for a sed that does not truncate output... /bin/sed checking for fgrep... grep -F checking for ld used by gcc -std=gnu17... /usr/bin/ld checking if the linker (/usr/bin/ld) is GNU ld... yes checking for BSD- or MS-compatible name lister (nm)... /usr/bin/nm -B checking the name lister (/usr/bin/nm -B) interface... BSD nm checking the maximum length of command line arguments... 1572864 checking whether the shell understands some XSI constructs... yes checking whether the shell understands "+="... yes checking for /usr/bin/ld option to reload object files... -r checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for ar... ar checking for strip... strip checking for ranlib... ranlib checking command to parse /usr/bin/nm -B output from gcc -std=gnu17 object... ok checking for dlfcn.h... yes checking whether the compiler supports GNU C++... (cached) yes checking whether g++ accepts -g... (cached) yes checking for g++ option to enable C++11 features... (cached) none needed checking dependency style of g++... (cached) gcc3 checking how to run the C++ preprocessor... g++ -E checking for objdir... .libs checking if gcc -std=gnu17 supports -fno-rtti -fno-exceptions... no checking for gcc -std=gnu17 option to produce PIC... -fPIC -DPIC checking if gcc -std=gnu17 PIC flag -fPIC -DPIC works... yes checking if gcc -std=gnu17 static flag -static works... yes checking if gcc -std=gnu17 supports -c -o file.o... yes checking if gcc -std=gnu17 supports -c -o file.o... (cached) yes checking whether the gcc -std=gnu17 linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for shl_load... no checking for shl_load in -ldld... no checking for dlopen... yes checking whether a program can dlopen itself... yes checking whether a statically linked program can dlopen itself... no checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... no checking whether to build static libraries... yes checking for ld used by g++... /usr/bin/ld -m elf_x86_64 checking if the linker (/usr/bin/ld -m elf_x86_64) is GNU ld... yes checking whether the g++ linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking for g++ option to produce PIC... -fPIC -DPIC checking if g++ PIC flag -fPIC -DPIC works... yes checking if g++ static flag -static works... yes checking if g++ supports -c -o file.o... yes checking if g++ supports -c -o file.o... (cached) yes checking whether the g++ linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for gcc -std=gnu17 options needed to detect all undeclared functions... none needed checking which extension is used for runtime loadable modules... .so checking which variable specifies run-time module search path... LD_LIBRARY_PATH checking for the default library search path... /lib64 /usr/lib64 /lib /usr/lib /opt/illumina/bsfs /usr/lib/x86_64-linux-gnu/libfakeroot /usr/local/lib/i386-linux-gnu /lib/i386-linux-gnu /usr/lib/i386-linux-gnu /usr/local/lib/i686-linux-gnu /lib/i686-linux-gnu /usr/lib/i686-linux-gnu /usr/local/lib /usr/local/lib/x86_64-linux-gnu /lib/x86_64-linux-gnu /usr/lib/x86_64-linux-gnu /lib32 /usr/lib32 checking for library containing dlopen... none required checking for dlerror... yes checking for shl_load... (cached) no checking for shl_load in -ldld... (cached) no checking for dld_link in -ldld... no checking for _ prefix in compiled symbols... no checking whether deplibs are loaded by dlopen... yes checking for argz.h... yes checking for error_t... yes checking for argz_add... yes checking for argz_append... yes checking for argz_count... yes checking for argz_create_sep... yes checking for argz_insert... yes checking for argz_next... yes checking for argz_stringify... yes checking if argz actually works... yes checking whether libtool supports -dlopen/-dlpreopen... yes checking for ltdl.h... yes checking whether lt_dlinterface_register is declared... yes checking for lt_dladvise_preload in -lltdl... yes checking where to find libltdl headers... checking where to find libltdl library... -lltdl checking for unistd.h... (cached) yes checking for dl.h... no checking for sys/dl.h... no checking for dld.h... no checking for mach-o/dyld.h... no checking for dirent.h... yes checking for closedir... yes checking for opendir... yes checking for readdir... yes checking for strlcat... yes checking for strlcpy... yes checking for X... disabled configure: WARNING: X11 not available. using tcl headers from -I/usr/include/tcl8.6 -I/usr/include/tcl8.6/generic checking for tcl.h... yes using /usr/lib/tclConfig.sh checking for wish8.6... /usr/bin/wish8.6 checking for tk.h... yes checking for tk.h... (cached) yes checking for tkInt.h... no using /usr/lib/tkConfig.sh checking for connect... yes checking for gethostbyname... yes checking for main in -lXpm... no configure: WARNING: Optional Xpm library not available checking for X11/Intrinsic.h... yes checking for X11/Xaw/Text.h... no configure: WARNING: Optional Xaw library not available - missing headers checking for zlib.h... yes checking for main in -lz... yes checking for deflateBound... no checking for GDK_PIXBUF... yes checking for GTK... no checking for GTKGL... no checking for GTKGLEXT... no checking for GLADE... no checking for qmake-qt4... no checking for qmake-qt3... no checking for qmake... no checking for sincos... yes checking if FILE struct contains _cnt... no checking if FILE struct contains _r... no checking if FILE struct contains _next... no checking if FILE struct contains _IO_read_end... yes checking if errno externs are declared... no checking if getopt externs are declared... yes checking if intptr_t is declared... yes checking if assert needs __eprintf... no checking that generated files are newer than configure... done configure: creating ./config.status config.status: creating Makefile config.status: creating lib/Makefile config.status: creating lib/cdt/Makefile config.status: creating lib/cdt/libcdt.pc config.status: creating lib/graph/Makefile config.status: creating lib/graph/libgraph.pc config.status: creating lib/rbtree/Makefile config.status: creating lib/pathplan/Makefile config.status: creating lib/pathplan/libpathplan.pc config.status: creating lib/dotgen/Makefile config.status: creating lib/neatogen/Makefile config.status: creating lib/fdpgen/Makefile config.status: creating lib/sparse/Makefile config.status: creating lib/sfdpgen/Makefile config.status: creating lib/osage/Makefile config.status: creating lib/circogen/Makefile config.status: creating lib/twopigen/Makefile config.status: creating lib/patchwork/Makefile config.status: creating lib/pack/Makefile config.status: creating lib/ortho/Makefile config.status: creating lib/common/Makefile config.status: creating lib/vpsc/Makefile config.status: creating lib/gvc/Makefile config.status: creating lib/gvc/libgvc.pc config.status: creating lib/xdot/Makefile config.status: creating lib/xdot/libxdot.pc config.status: creating plugin/Makefile config.status: creating plugin/core/Makefile config.status: creating plugin/dot_layout/Makefile config.status: creating plugin/neato_layout/Makefile config.status: creating graphviz.spec config.status: creating Doxyfile config.status: creating config.h config.status: executing depfiles commands config.status: executing libtool commands === configuring in libltdl (/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/libltdl) configure: running /bin/bash ./configure --disable-option-checking '--prefix=/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix' 'CC=gcc -std=gnu17' 'CXX=g++' 'CFLAGS=-g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3' 'CXXFLAGS=-g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3' 'LDFLAGS=-Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro' '--libdir=/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' '--includedir=/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include' '--with-cgraph=no' '--enable-swig=no' '--enable-static' '--disable-shared' '--with-pic' '--with-libgd=no' '--disable-ltdl' '--without-x' '--without-expat' '--without-devil' '--without-rsvg' '--without-ghostscript' '--without-visio' '--without-pangocairo' '--without-lasi' '--without-glitz' '--without-freetype2' '--without-fontconfig' '--without-rpat' '--without-glut' '--without-gts' '--without-png' '--without-tcl' '--without-jpeg' 'R_LIBS=/home/omnipath/local/R/4.5-3.21/00LOCK-Rgraphviz/00new:/home/omnipath/local/R/4.5-3.21:/home/omnipath/local/R/4.5-3.21:/home/omnipath/local/R/4.5' --cache-file=/dev/null --srcdir=. checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for a race-free mkdir -p... /usr/bin/mkdir -p checking for gawk... gawk checking whether make sets $(MAKE)... yes checking build system type... x86_64-pc-linux-gnu checking host system type... x86_64-pc-linux-gnu checking for style of include used by make... GNU checking for gcc... gcc -std=gnu17 checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc -std=gnu17 accepts -g... yes checking for gcc -std=gnu17 option to enable C11 features... none needed checking dependency style of gcc -std=gnu17... gcc3 checking for a sed that does not truncate output... /bin/sed checking for grep that handles long lines and -e... /usr/bin/grep checking for egrep... /usr/bin/grep -E checking for fgrep... /usr/bin/grep -F checking for ld used by gcc -std=gnu17... /usr/bin/ld checking if the linker (/usr/bin/ld) is GNU ld... yes checking for BSD- or MS-compatible name lister (nm)... /usr/bin/nm -B checking the name lister (/usr/bin/nm -B) interface... BSD nm checking whether ln -s works... yes checking the maximum length of command line arguments... 1572864 checking whether the shell understands some XSI constructs... yes checking whether the shell understands "+="... yes checking for /usr/bin/ld option to reload object files... -r checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for ar... ar checking for strip... strip checking for ranlib... ranlib checking command to parse /usr/bin/nm -B output from gcc -std=gnu17 object... ok checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for dlfcn.h... yes checking for objdir... .libs checking if gcc -std=gnu17 supports -fno-rtti -fno-exceptions... no checking for gcc -std=gnu17 option to produce PIC... -fPIC -DPIC checking if gcc -std=gnu17 PIC flag -fPIC -DPIC works... yes checking if gcc -std=gnu17 static flag -static works... yes checking if gcc -std=gnu17 supports -c -o file.o... yes checking if gcc -std=gnu17 supports -c -o file.o... (cached) yes checking whether the gcc -std=gnu17 linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for shl_load... no checking for shl_load in -ldld... no checking for dlopen... yes checking whether a program can dlopen itself... yes checking whether a statically linked program can dlopen itself... no checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... no checking whether to build static libraries... yes checking which extension is used for runtime loadable modules... .so checking which variable specifies run-time module search path... LD_LIBRARY_PATH checking for the default library search path... /lib64 /usr/lib64 /lib /usr/lib /opt/illumina/bsfs /usr/lib/x86_64-linux-gnu/libfakeroot /usr/local/lib/i386-linux-gnu /lib/i386-linux-gnu /usr/lib/i386-linux-gnu /usr/local/lib/i686-linux-gnu /lib/i686-linux-gnu /usr/lib/i686-linux-gnu /usr/local/lib /usr/local/lib/x86_64-linux-gnu /lib/x86_64-linux-gnu /usr/lib/x86_64-linux-gnu /lib32 /usr/lib32 checking for gcc -std=gnu17 options needed to detect all undeclared functions... none needed checking for library containing dlopen... none required checking for dlerror... yes checking for shl_load... (cached) no checking for shl_load in -ldld... (cached) no checking for dld_link in -ldld... no checking for _ prefix in compiled symbols... no checking whether deplibs are loaded by dlopen... yes checking for argz.h... yes checking for error_t... yes checking for argz_add... yes checking for argz_append... yes checking for argz_count... yes checking for argz_create_sep... yes checking for argz_insert... yes checking for argz_next... yes checking for argz_stringify... yes checking if argz actually works... yes checking whether libtool supports -dlopen/-dlpreopen... yes checking for unistd.h... (cached) yes checking for dl.h... no checking for sys/dl.h... no checking for dld.h... no checking for mach-o/dyld.h... no checking for dirent.h... yes checking for closedir... yes checking for opendir... yes checking for readdir... yes checking for strlcat... yes checking for strlcpy... yes checking that generated files are newer than configure... done configure: creating ./config.status config.status: creating Makefile config.status: creating config.h config.status: executing depfiles commands config.status: executing libtool commands ---------------------------------------------------------------- graphviz-2.28.0 will be compiled with the following: options: cgraph: No (disabled by default - experimental) digcola: Yes expat: No (disabled) fontconfig: No (disabled) freetype: No (disabled) glut: No (disabled) gts: No (disabled) ipsepcola: No (disabled by default - C++ portability issues) ltdl: No (disabled) ortho: Yes png: No (disabled) jpeg: No (disabled) sfdp: Yes shared: No (disabled) static: Yes qt: No (qmake not found) commands: dot: Yes (always enabled) neato: Yes (always enabled) fdp: Yes (always enabled) circo: Yes (always enabled) twopi: Yes (always enabled) gvpr: Yes (always enabled) gvmap: Yes (always enabled) lefty: No (missing Xaw headers) smyrna: No (disabled by default - experimental) gvedit: No (qmake not found) plugin libraries: dot_layout: Yes (always enabled) neato_layout: Yes (always enabled) core: Yes (always enabled) devil: No (disabled) gd: No (disabled) gdiplus: No (disabled by default - Windows only) gdk_pixbuf: Yes ghostscript: No (disabled) glitz: No (disabled by default - incomplete) gtk: No (gtk library not available) lasi: No (disabled) ming: No (disabled by default - incomplete) pangocairo: No (disabled) quartz: No (disabled by default - Mac only) rsvg: No (disabled) visio: No (disabled by default - experimental) xlib: No (disabled or unavailable) language extensions: gv_sharp: No (swig not available) gv_go: No (disabled by default - experimental) gv_guile: No (swig not available) gv_io: No (disabled by default - no swig support yet) gv_java: No (swig not available) gv_lua: No (swig not available) gv_ocaml: No (swig not available) gv_perl: No (swig not available) gv_php: No (swig not available) gv_python: No (swig not available) gv_python23: No (disabled by default - for multiversion installs) gv_python24: No (disabled by default - for multiversion installs) gv_python25: No (disabled by default - for multiversion installs) gv_python26: No (disabled by default - for multiversion installs) gv_python27: No (disabled by default - for multiversion installs) gv_R: No (swig not available) gv_ruby: No (swig not available) gv_tcl: No (swig not available) tcldot: Yes tclpathplan: Yes gdtclft: No (gd not available) tkspline: Yes grep 'PACKAGE\|VERSION\|GVPLUGIN' config.h > graphviz_version.h make install-recursive make[1]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz' Making install in libltdl make[2]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/libltdl' make install-am make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/libltdl' /bin/bash ./libtool --tag=CC --mode=compile gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT dlopen.lo -MD -MP -MF .deps/dlopen.Tpo -c -o dlopen.lo `test -f 'loaders/dlopen.c' || echo './'`loaders/dlopen.c libtool: compile: gcc -std=gnu17 -DHAVE_CONFIG_H -I. "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT dlopen.lo -MD -MP -MF .deps/dlopen.Tpo -c loaders/dlopen.c -fPIC -DPIC -o dlopen.o mv -f .deps/dlopen.Tpo .deps/dlopen.Plo /bin/bash ./libtool --tag=CC --mode=link gcc -std=gnu17 -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -module -avoid-version -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o dlopen.la dlopen.lo libtool: link: ar cru .libs/dlopen.a dlopen.o ar: `u' modifier ignored since `D' is the default (see `U') libtool: link: ranlib .libs/dlopen.a libtool: link: ( cd ".libs" && rm -f "dlopen.la" && ln -s "../dlopen.la" "dlopen.la" ) /bin/bash ./libtool --tag=CC --mode=compile gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-preopen.lo -MD -MP -MF .deps/libltdlc_la-preopen.Tpo -c -o libltdlc_la-preopen.lo `test -f 'loaders/preopen.c' || echo './'`loaders/preopen.c libtool: compile: gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-preopen.lo -MD -MP -MF .deps/libltdlc_la-preopen.Tpo -c loaders/preopen.c -fPIC -DPIC -o libltdlc_la-preopen.o mv -f .deps/libltdlc_la-preopen.Tpo .deps/libltdlc_la-preopen.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-lt__alloc.lo -MD -MP -MF .deps/libltdlc_la-lt__alloc.Tpo -c -o libltdlc_la-lt__alloc.lo `test -f 'lt__alloc.c' || echo './'`lt__alloc.c libtool: compile: gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-lt__alloc.lo -MD -MP -MF .deps/libltdlc_la-lt__alloc.Tpo -c lt__alloc.c -fPIC -DPIC -o libltdlc_la-lt__alloc.o mv -f .deps/libltdlc_la-lt__alloc.Tpo .deps/libltdlc_la-lt__alloc.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-lt_dlloader.lo -MD -MP -MF .deps/libltdlc_la-lt_dlloader.Tpo -c -o libltdlc_la-lt_dlloader.lo `test -f 'lt_dlloader.c' || echo './'`lt_dlloader.c libtool: compile: gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-lt_dlloader.lo -MD -MP -MF .deps/libltdlc_la-lt_dlloader.Tpo -c lt_dlloader.c -fPIC -DPIC -o libltdlc_la-lt_dlloader.o mv -f .deps/libltdlc_la-lt_dlloader.Tpo .deps/libltdlc_la-lt_dlloader.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-lt_error.lo -MD -MP -MF .deps/libltdlc_la-lt_error.Tpo -c -o libltdlc_la-lt_error.lo `test -f 'lt_error.c' || echo './'`lt_error.c libtool: compile: gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-lt_error.lo -MD -MP -MF .deps/libltdlc_la-lt_error.Tpo -c lt_error.c -fPIC -DPIC -o libltdlc_la-lt_error.o mv -f .deps/libltdlc_la-lt_error.Tpo .deps/libltdlc_la-lt_error.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-ltdl.lo -MD -MP -MF .deps/libltdlc_la-ltdl.Tpo -c -o libltdlc_la-ltdl.lo `test -f 'ltdl.c' || echo './'`ltdl.c libtool: compile: gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-ltdl.lo -MD -MP -MF .deps/libltdlc_la-ltdl.Tpo -c ltdl.c -fPIC -DPIC -o libltdlc_la-ltdl.o mv -f .deps/libltdlc_la-ltdl.Tpo .deps/libltdlc_la-ltdl.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-slist.lo -MD -MP -MF .deps/libltdlc_la-slist.Tpo -c -o libltdlc_la-slist.lo `test -f 'slist.c' || echo './'`slist.c libtool: compile: gcc -std=gnu17 -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -MT libltdlc_la-slist.lo -MD -MP -MF .deps/libltdlc_la-slist.Tpo -c slist.c -fPIC -DPIC -o libltdlc_la-slist.o mv -f .deps/libltdlc_la-slist.Tpo .deps/libltdlc_la-slist.Plo /bin/bash ./libtool --tag=CC --mode=link gcc -std=gnu17 -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -no-undefined -dlpreopen dlopen.la -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o libltdlc.la libltdlc_la-preopen.lo libltdlc_la-lt__alloc.lo libltdlc_la-lt_dlloader.lo libltdlc_la-lt_error.lo libltdlc_la-ltdl.lo libltdlc_la-slist.lo libtool: link: rm -f .libs/libltdlc.nm .libs/libltdlc.nmS .libs/libltdlc.nmT libtool: link: (cd .libs && gcc -std=gnu17 -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c -fno-builtin -fPIC -DPIC "libltdlcS.c") libtool: link: rm -f ".libs/libltdlcS.c" ".libs/libltdlc.nm" ".libs/libltdlc.nmS" ".libs/libltdlc.nmT" libtool: link: (cd .libs/libltdlc.lax/dlopen.a && ar x "/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/libltdl/./.libs/dlopen.a") libtool: link: ar cru .libs/libltdlc.a libltdlc_la-preopen.o libltdlc_la-lt__alloc.o libltdlc_la-lt_dlloader.o libltdlc_la-lt_error.o libltdlc_la-ltdl.o libltdlc_la-slist.o .libs/libltdlcS.o .libs/libltdlc.lax/dlopen.a/dlopen.o ar: `u' modifier ignored since `D' is the default (see `U') libtool: link: ranlib .libs/libltdlc.a libtool: link: rm -fr .libs/libltdlc.lax libtool: link: ( cd ".libs" && rm -f "libltdlc.la" && ln -s "../libltdlc.la" "libltdlc.la" ) make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/libltdl' make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/libltdl' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/libltdl' make[2]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/libltdl' Making install in lib make[2]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib' Making install in cdt make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/cdt' CC dtclose.lo CC dtdisc.lo dtdisc.c:13:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 13 | static Void_t* dtmemory(dt, addr, size, disc) | ^~~~~~~~ CC dtextract.lo CC dtflatten.lo CC dthash.lo dthash.c:15:13: warning: function declaration isn't a prototype [-Wstrict-prototypes] 15 | static void dthtab(dt) | ^~~~~~ dthash.c:81:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 81 | static Void_t* dthash(dt,obj,type) | ^~~~~~ dthash.c: In function 'dthash': dthash.c:306:34: warning: 'r' may be used uninitialized [-Wmaybe-uninitialized] 306 | (*dt->memoryf)(dt,(Void_t*)r,0,disc); | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ dthash.c:87:30: note: 'r' was declared here 87 | reg Dtlink_t *t, *r, *p; | ^ CC dtlist.lo dtlist.c:11:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 11 | static Void_t* dtlist(dt, obj, type) | ^~~~~~ CC dtmethod.lo CC dtopen.lo CC dtrenew.lo CC dtrestore.lo CC dtsize.lo dtsize.c:11:12: warning: function declaration isn't a prototype [-Wstrict-prototypes] 11 | static int treecount(e) | ^~~~~~~~~ CC dtstat.lo dtstat.c:11:13: warning: function declaration isn't a prototype [-Wstrict-prototypes] 11 | static void dttstat(ds,root,depth,level) | ^~~~~~~ dtstat.c:31:13: warning: function declaration isn't a prototype [-Wstrict-prototypes] 31 | static void dthstat(data, ds, count) | ^~~~~~~ CC dtstrhash.lo CC dttree.lo dttree.c:14:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 14 | static Void_t* dttree(dt,obj,type) | ^~~~~~ dttree.c: In function 'dttree': dttree.c:294:43: warning: 'me' may be used uninitialized [-Wmaybe-uninitialized] 294 | me->right = link.left; dttree.c:23:34: note: 'me' was declared here 23 | Dtlink_t *l, *r, *me, link; | ^~ CC dttreeset.lo dttreeset.c:11:18: warning: function declaration isn't a prototype [-Wstrict-prototypes] 11 | static Dtlink_t* treebalance(list, size) | ^~~~~~~~~~~ CC dtview.lo dtview.c:12:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 12 | static Void_t* dtvsearch(dt,obj,type) | ^~~~~~~~~ dtview.c: In function 'dtvsearch': dtview.c:20:30: warning: variable 'lk' set but not used [-Wunused-but-set-variable] 20 | int cmp, lk, sz, ky; | ^~ CC dtwalk.lo dtwalk.c: In function 'dtwalk': dtwalk.c:14:1: warning: function declaration isn't a prototype [-Wstrict-prototypes] 14 | int(* userf)(); | ^~~ CCLD libcdt.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libcdt_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/cdt' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libcdt.la '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libcdt.lai /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libcdt.la libtool: install: /usr/bin/install -c .libs/libcdt.a /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libcdt.a libtool: install: chmod 644 /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libcdt.a libtool: install: ranlib /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libcdt.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 cdt.3 '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 cdt.3.pdf '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libcdt.pc '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 cdt.h '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/cdt' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/cdt' Making install in graph make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/graph' CC attribs.lo CC agxbuf.lo CC edge.lo CC graph.lo graph.c: In function 'agclose': graph.c:374:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation] 374 | if (g->attr) | ^~ graph.c:376:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if' 376 | if (g->didset) | ^~ CC graphio.lo CC lexer.lo lexer.c: In function 'scan_token': lexer.c:141:11: warning: comparison between pointer and zero character constant [-Wpointer-compare] 141 | if (p == '\0') | ^~ lexer.c:141:9: note: did you mean to dereference the pointer? 141 | if (p == '\0') | ^ lexer.c:147:12: warning: pointer targets in returning 'unsigned char *' from a function with return type 'char *' differ in signedness [-Wpointer-sign] 147 | return p; | ^ lexer.c: In function 'html_pair': lexer.c:322:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 322 | int rc, depth = 1; | ^~ In file included from lexer.c:20: lexer.c: In function 'aglex': agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ lexer.c:413:36: note: in expansion of macro 'agxbuse' 413 | aglval.str = agstrdup_html(agxbuse(&xb)); | ^~~~~~~ lexer.c:435:33: warning: pointer targets in passing argument 1 of 'scan_token' differ in signedness [-Wpointer-sign] 435 | LexPtr = scan_token(LexPtr, tbuf); | ^~~~~~ | | | char * lexer.c:136:40: note: expected 'unsigned char *' but argument is of type 'char *' 136 | static char *scan_token(unsigned char *p, unsigned char *token) | ~~~~~~~~~~~~~~~^ lexer.c:435:41: warning: pointer targets in passing argument 2 of 'scan_token' differ in signedness [-Wpointer-sign] 435 | LexPtr = scan_token(LexPtr, tbuf); | ^~~~ | | | char * lexer.c:136:58: note: expected 'unsigned char *' but argument is of type 'char *' 136 | static char *scan_token(unsigned char *p, unsigned char *token) | ~~~~~~~~~~~~~~~^~~~~ lexer.c: In function 'aglasterr': lexer.c:527:5: warning: ignoring return value of 'fread' declared with attribute 'warn_unused_result' [-Wunused-result] 527 | fread(buf, sizeof(char), len, agerrout); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CC node.lo CC parser.lo CC refstr.lo CC trie.lo CCLD libgraph.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgraph_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/graph' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgraph.la '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libgraph.lai /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libgraph.la libtool: install: /usr/bin/install -c .libs/libgraph.a /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libgraph.a libtool: install: chmod 644 /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libgraph.a libtool: install: ranlib /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libgraph.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 graph.3 '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 graph.3.pdf '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libgraph.pc '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 graph.h '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/graph' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/graph' Making install in pathplan make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/pathplan' CC cvt.lo cvt.c:276:13: warning: 'append_bezier' defined but not used [-Wunused-function] 276 | static void append_bezier(Ppoint_t * bezier) | ^~~~~~~~~~~~~ CC inpoly.lo CC route.lo route.c:107:29: warning: argument 4 of type 'Ppoint_t *' {aka 'struct Pxy_t *'} declared as a pointer [-Warray-parameter=] 107 | Ppoint_t * evs, Ppolyline_t * output) | ~~~~~~~~~~~^~~ In file included from pathutil.h:20, from route.c:21: pathplan.h:37:39: note: previously declared as an array 'Pvector_t[2]' {aka 'struct Pxy_t[2]'} 37 | Pvector_t endpoint_slopes[2], | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~ CC shortest.lo shortest.c:103:47: warning: argument 2 of type 'Ppoint_t *' {aka 'struct Pxy_t *'} declared as a pointer [-Warray-parameter=] 103 | int Pshortestpath(Ppoly_t * polyp, Ppoint_t * eps, Ppolyline_t * output) | ~~~~~~~~~~~^~~ In file included from pathutil.h:20, from shortest.c:22: pathplan.h:31:59: note: previously declared as an array 'Ppoint_t[2]' {aka 'struct Pxy_t[2]'} 31 | extern int Pshortestpath(Ppoly_t * boundary, Ppoint_t endpoints[2], | ~~~~~~~~~^~~~~~~~~~~~ CC shortestpth.lo CC solvers.lo CC triang.lo CC util.lo CC visibility.lo CCLD libpathplan.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libpathplan_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/pathplan' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libpathplan.la '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libpathplan.lai /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libpathplan.la libtool: install: /usr/bin/install -c .libs/libpathplan.a /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libpathplan.a libtool: install: chmod 644 /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libpathplan.a libtool: install: ranlib /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libpathplan.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 pathplan.3 '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 pathplan.3.pdf '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libpathplan.pc '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 pathgeom.h pathplan.h '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/pathplan' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/pathplan' Making install in vpsc make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/vpsc' make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/vpsc' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/vpsc' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/vpsc' Making install in rbtree make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/rbtree' CC misc.lo CC red_black_tree.lo CC stack.lo CCLD librbtree_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/rbtree' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/rbtree' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/rbtree' Making install in ortho make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/ortho' CC fPQ.lo CC intset.lo CC maze.lo maze.c: In function 'mkMazeGraph': maze.c:325:20: warning: variable 'ncnt' set but not used [-Wunused-but-set-variable] 325 | int nsides, i, ncnt, maxdeg; | ^~~~ CC ortho.lo ortho.c: In function 'addLoop': ortho.c:461:16: warning: variable 'wt' set but not used [-Wunused-but-set-variable] 461 | double wt; | ^~ ortho.c: In function 'addNodeEdges': ortho.c:497:16: warning: variable 'wt' set but not used [-Wunused-but-set-variable] 497 | double wt; | ^~ In file included from /usr/include/stdio.h:980, from ../../lib/common/types.h:17, from structures.h:17, from sgraph.h:17, from maze.h:17, from ortho.c:31: In function 'fprintf', inlined from 'putSeg' at ortho.c:545:5: /usr/include/x86_64-linux-gnu/bits/stdio2.h:79:10: warning: 's' may be used uninitialized [-Wmaybe-uninitialized] 79 | return __fprintf_chk (__stream, __USE_FORTIFY_LEVEL - 1, __fmt, | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 80 | __va_arg_pack ()); | ~~~~~~~~~~~~~~~~~ ortho.c: In function 'putSeg': ortho.c:518:9: note: 's' was declared here 518 | char* s; | ^ In function 'fprintf', inlined from 'putSeg' at ortho.c:545:5: /usr/include/x86_64-linux-gnu/bits/stdio2.h:79:10: warning: 's' may be used uninitialized [-Wmaybe-uninitialized] 79 | return __fprintf_chk (__stream, __USE_FORTIFY_LEVEL - 1, __fmt, | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 80 | __va_arg_pack ()); | ~~~~~~~~~~~~~~~~~ ortho.c: In function 'putSeg': ortho.c:518:9: note: 's' was declared here 518 | char* s; | ^ In function 'fprintf', inlined from 'putSeg' at ortho.c:542:5: /usr/include/x86_64-linux-gnu/bits/stdio2.h:79:10: warning: 's' may be used uninitialized [-Wmaybe-uninitialized] 79 | return __fprintf_chk (__stream, __USE_FORTIFY_LEVEL - 1, __fmt, | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 80 | __va_arg_pack ()); | ~~~~~~~~~~~~~~~~~ ortho.c: In function 'putSeg': ortho.c:518:9: note: 's' was declared here 518 | char* s; | ^ In function 'fprintf', inlined from 'putSeg' at ortho.c:542:5: /usr/include/x86_64-linux-gnu/bits/stdio2.h:79:10: warning: 's' may be used uninitialized [-Wmaybe-uninitialized] 79 | return __fprintf_chk (__stream, __USE_FORTIFY_LEVEL - 1, __fmt, | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 80 | __va_arg_pack ()); | ~~~~~~~~~~~~~~~~~ ortho.c: In function 'putSeg': ortho.c:518:9: note: 's' was declared here 518 | char* s; | ^ ortho.c: In function 'orthoEdges': ortho.c:1303:25: warning: 'ps' may be used uninitialized [-Wmaybe-uninitialized] 1303 | if (isInPS (ps,hi,ti)) continue; | ^~~~~~~~~~~~~~~~~ ortho.c:1250:15: note: 'ps' was declared here 1250 | PointSet* ps; | ^~ In function 'convertSPtoRoute', inlined from 'orthoEdges' at ortho.c:1341:25: ortho.c:179:25: warning: 'prevbp.y' may be used uninitialized [-Wmaybe-uninitialized] 179 | else if (prevbp.y > bp1.y) l1 = B_UP; | ^ ortho.c: In function 'orthoEdges': ortho.c:152:22: note: 'prevbp.y' was declared here 152 | pointf bp1, bp2, prevbp; /* bend points */ | ^~~~~~ In function 'convertSPtoRoute', inlined from 'orthoEdges' at ortho.c:1341:25: ortho.c:192:25: warning: 'prevbp.x' may be used uninitialized [-Wmaybe-uninitialized] 192 | else if (prevbp.x > bp1.x) l1 = B_RIGHT; | ^ ortho.c: In function 'orthoEdges': ortho.c:152:22: note: 'prevbp.x' was declared here 152 | pointf bp1, bp2, prevbp; /* bend points */ | ^~~~~~ CC partition.lo partition.c: In function 'traverse_polygon': partition.c:328:7: warning: variable 'do_switch' set but not used [-Wunused-but-set-variable] 328 | int do_switch = FALSE; | ^~~~~~~~~ partition.c:327:7: warning: variable 'retval' set but not used [-Wunused-but-set-variable] 327 | int retval; | ^~~~~~ partition.c: In function 'partition': partition.c:731:9: warning: variable 'nt' set but not used [-Wunused-but-set-variable] 731 | int nt; | ^~ partition.c: In function 'make_new_monotone_poly': partition.c:298:18: warning: 'tp' may be used uninitialized [-Wmaybe-uninitialized] 298 | vp0->vnext[ip] = v1; | ~~~~~~~~~~~~~~~^~~~ partition.c:212:7: note: 'tp' was declared here 212 | int tp, tq; | ^~ partition.c:274:5: warning: 'tq' may be used uninitialized [-Wmaybe-uninitialized] 274 | q = vp1->vpos[iq]; | ~~^~~~~~~~~~~~~~~ partition.c:212:11: note: 'tq' was declared here 212 | int tp, tq; | ^~ partition.c: In function 'monotonate_trapezoids': partition.c:665:10: warning: 'size' may be used uninitialized [-Wmaybe-uninitialized] 665 | return size; | ^~~~ partition.c:620:12: note: 'size' was declared here 620 | int i, size; | ^~~~ CC rawgraph.lo CC sgraph.lo CC trapezoid.lo trapezoid.c:22: warning: "__USE_ISOC99" redefined 22 | #define __USE_ISOC99 | In file included from /usr/include/x86_64-linux-gnu/bits/libc-header-start.h:33, from /usr/include/string.h:26, from trapezoid.c:19: /usr/include/features.h:347: note: this is the location of the previous definition 347 | # define __USE_ISOC99 1 | trapezoid.c:66:12: warning: function declaration isn't a prototype [-Wstrict-prototypes] 66 | static int newnode() | ^~~~~~~ trapezoid.c: In function 'add_segment': trapezoid.c:437:7: warning: variable 'tritop' set but not used [-Wunused-but-set-variable] 437 | int tritop = 0, tribot = 0, is_swapped; | ^~~~~~ trapezoid.c: In function 'add_segment.isra': trapezoid.c:996:3: warning: 'tfirstr' may be used uninitialized [-Wmaybe-uninitialized] 996 | merge_trapezoids(segnum, tfirstr, tlastr, S_RIGHT, tr, qs); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ trapezoid.c:434:7: note: 'tfirstr' was declared here 434 | int tfirstr, tlastr, tfirstl, tlastl; | ^~~~~~~ trapezoid.c:996:3: warning: 'tlastr' may be used uninitialized [-Wmaybe-uninitialized] 996 | merge_trapezoids(segnum, tfirstr, tlastr, S_RIGHT, tr, qs); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ trapezoid.c:434:16: note: 'tlastr' was declared here 434 | int tfirstr, tlastr, tfirstl, tlastl; | ^~~~~~ CCLD libortho_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/ortho' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/ortho' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/ortho' Making install in sparse make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/sparse' CC SparseMatrix.lo SparseMatrix.c: In function 'SparseMatrix_import_binary': SparseMatrix.c:629:48: warning: variable 'iread' set but not used [-Wunused-but-set-variable] 629 | int m, n, nz, nzmax, type, format, property, iread; | ^~~~~ CC general.lo CC BinaryHeap.lo In file included from general.h:21, from BinaryHeap.h:17, from BinaryHeap.c:14: BinaryHeap.c: In function 'BinaryHeap_sanity_check': BinaryHeap.c:269:74: warning: suggest parentheses around assignment used as truth value [-Wparentheses] 269 | for (i = 0; i < h->len + IntStack_get_length(h->id_stack); i++) assert(mask[i] =- 1); | ^~~~ CC IntStack.lo CCLD libsparse_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/sparse' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/sparse' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/sparse' Making install in patchwork make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/patchwork' CC patchwork.lo In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:231:12: warning: pointer 'cp' used after 'free' [-Wuse-after-free] 231 | cp = cp->rightsib; | ~~~^~~~~~~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:233:5: note: call to 'free' here 233 | free (tp); | ^~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:231:12: warning: pointer 'cp' used after 'free' [-Wuse-after-free] 231 | cp = cp->rightsib; | ~~~^~~~~~~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:233:5: note: call to 'free' here 233 | free (tp); | ^~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:231:12: warning: pointer 'cp' used after 'free' [-Wuse-after-free] 231 | cp = cp->rightsib; | ~~~^~~~~~~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:233:5: note: call to 'free' here 233 | free (tp); | ^~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:231:12: warning: pointer 'cp' used after 'free' [-Wuse-after-free] 231 | cp = cp->rightsib; | ~~~^~~~~~~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:233:5: note: call to 'free' here 233 | free (tp); | ^~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:231:12: warning: pointer 'cp' used after 'free' [-Wuse-after-free] 231 | cp = cp->rightsib; | ~~~^~~~~~~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:233:5: note: call to 'free' here 233 | free (tp); | ^~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:231:12: warning: pointer 'cp' used after 'free' [-Wuse-after-free] 231 | cp = cp->rightsib; | ~~~^~~~~~~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:233:5: note: call to 'free' here 233 | free (tp); | ^~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:231:12: warning: pointer 'cp' used after 'free' [-Wuse-after-free] 231 | cp = cp->rightsib; | ~~~^~~~~~~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2, inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:233:5: note: call to 'free' here 233 | free (tp); | ^~~~~~~~~ patchwork.c: In function 'freeTree': patchwork.c:231:12: warning: pointer 'cp' used after 'free' [-Wuse-after-free] 231 | cp = cp->rightsib; | ~~~^~~~~~~~~~~~~~ In function 'freeTree', inlined from 'freeTree' at patchwork.c:230:2: patchwork.c:233:5: note: call to 'free' here 233 | free (tp); | ^~~~~~~~~ CC patchworkinit.lo CC tree_map.lo CCLD libpatchwork_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/patchwork' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/patchwork' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/patchwork' Making install in common make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/common' CC arrows.lo arrows.c: In function 'arrowOrthoClip': arrows.c:397:28: warning: 'hlen' may be used uninitialized [-Wmaybe-uninitialized] 397 | else r.y = p.y - hlen; | ~~~~^~~~~~ arrows.c:317:21: note: 'hlen' was declared here 317 | double d, tlen, hlen, maxd; | ^~~~ CC colxlate.lo CC fontmetrics.lo CC args.lo CC memory.lo CC globals.lo CC htmllex.lo In file included from render.h:47, from htmllex.c:15: htmllex.c: In function 'error_context': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ htmllex.c:57:35: note: in expansion of macro 'agxbuse' 57 | agerr(AGPREV, "... %s ...\n", agxbuse(state.xb)); | ^~~~~~~ CC htmlparse.lo In file included from render.h:47, from ../../lib/common/htmlparse.y:16: ../../lib/common/htmlparse.y: In function 'appendFItemList': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ ../../lib/common/htmlparse.y:193:25: note: in expansion of macro 'agxbuse' 193 | fi->ti.str = strdup(agxbuse(ag)); | ^~~~~~~ ../../lib/common/htmlparse.y: In function 'htmlparse': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ ../../lib/common/htmlparse.y:500:24: note: in expansion of macro 'agxbuse' 500 | if (nonSpace(agxbuse(HTMLstate.str))) { | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ ../../lib/common/htmlparse.y:511:24: note: in expansion of macro 'agxbuse' 511 | if (nonSpace(agxbuse(HTMLstate.str))) { | ^~~~~~~ CC htmltable.lo In file included from render.h:47, from htmltable.c:35: htmltable.c: In function 'initAnchor': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ htmltable.c:299:14: note: in expansion of macro 'agxbuse' 299 | id = agxbuse (&xb); | ^~~~~~~ htmltable.c: In function 'nameOf': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ htmltable.c:1665:12: note: in expansion of macro 'agxbuse' 1665 | return agxbuse(xb); | ^~~~~~~ htmltable.c: In function 'make_html_label': htmltable.c:1828:12: warning: 'env.g' may be used uninitialized [-Wmaybe-uninitialized] 1828 | g = env.g->root; | ~~~^~ htmltable.c:1809:15: note: 'env' declared here 1809 | htmlenv_t env; | ^~~ CC input.lo input.c: In function 'dotneato_basename': input.c:136:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation] 136 | while (*s) s++; s--; | ^~~~~ input.c:136:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while' 136 | while (*s) s++; s--; | ^ In file included from render.h:47, from input.c:15: input.c: In function 'global_def': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ input.c:200:24: note: in expansion of macro 'agxbuse' 200 | sym = dclfun(NULL, agxbuse (xb), rhs); | ^~~~~~~ CC pointset.lo CC postproc.lo CC routespl.lo CC splines.lo CC psusershape.lo psusershape.c: In function 'user_init': psusershape.c:49:30: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 49 | int saw_bb, must_inline, rc; | ^~ In file included from render.h:47, from psusershape.c:20: psusershape.c: In function 'ps_string': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ psusershape.c:303:5: note: in expansion of macro 'agxbputc' 303 | agxbputc (&xb, RPAREN); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ psusershape.c:305:9: note: in expansion of macro 'agxbuse' 305 | s = agxbuse(&xb); | ^~~~~~~ psusershape.c:268:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 268 | int rc; | ^~ CC timing.lo CC labels.lo labels.c: In function 'xml_url_string': labels.c:561:21: warning: variable 'prev' set but not used [-Wunused-but-set-variable] 561 | char *p, *sub, *prev = NULL; | ^~~~ CC ns.lo CC shapes.lo CC utils.lo utils.c: In function 'chkPort': utils.c:690:5: warning: this 'else' clause does not guard... [-Wmisleading-indentation] 690 | else | ^~~~ utils.c:692:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else' 692 | pt.name = s; | ^~ In file included from render.h:47, from utils.c:14: utils.c: In function 'clustNode': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ utils.c:950:5: note: in expansion of macro 'agxbputc' 950 | agxbputc(xb, ':'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ utils.c:954:29: note: in expansion of macro 'agxbuse' 954 | cn = agnode(agroot(cg), agxbuse(xb)); | ^~~~~~~ utils.c: In function 'scanEntity': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ utils.c:1359:5: note: in expansion of macro 'agxbputc' 1359 | agxbputc(xb, '&'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ utils.c:1369:5: note: in expansion of macro 'agxbputc' 1369 | agxbputc(xb, '#'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ utils.c:1371:5: note: in expansion of macro 'agxbputc' 1371 | agxbputc(xb, ';'); | ^~~~~~~~ utils.c: In function 'htmlEntityUTF8': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ utils.c:1515:18: note: in expansion of macro 'agxbuse' 1515 | ns = strdup (agxbuse(&xb)); | ^~~~~~~ utils.c:1456:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 1456 | int rc; | ^~ utils.c: In function 'latin1ToUTF8': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ utils.c:1555:18: note: in expansion of macro 'agxbuse' 1555 | ns = strdup (agxbuse(&xb)); | ^~~~~~~ utils.c:1531:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 1531 | int rc; | ^~ utils.c: In function 'utf8ToLatin1': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ utils.c:1587:18: note: in expansion of macro 'agxbuse' 1587 | ns = strdup (agxbuse(&xb)); | ^~~~~~~ utils.c:1573:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 1573 | int rc; | ^~ CC geom.lo CC output.lo In file included from render.h:47, from output.c:14: output.c: In function 'attach_attrs_and_arrows': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ output.c:350:29: note: in expansion of macro 'agxbuse' 350 | agset(n, "pos", agxbuse(&xb)); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ output.c:373:31: note: in expansion of macro 'agxbuse' 373 | agset(n, "rects", agxbuse(&xb)); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ output.c:391:25: note: in expansion of macro 'agxbputc' 391 | agxbputc(&xb, ' '); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ output.c:403:46: note: in expansion of macro 'agxbuse' 403 | agxset(n, N_vertices->index, agxbuse(&xb)); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ output.c:417:25: note: in expansion of macro 'agxbputc' 417 | agxbputc(&xb, ';'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ output.c:434:29: note: in expansion of macro 'agxbputc' 434 | agxbputc(&xb, ' '); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ output.c:440:33: note: in expansion of macro 'agxbuse' 440 | agset(e, "pos", agxbuse(&xb)); | ^~~~~~~ CC emit.lo In file included from render.h:47, from emit.c:25: emit.c: In function 'getObjId': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:212:9: note: in expansion of macro 'agxbputc' 212 | agxbputc (xb, '_'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ emit.c:218:12: note: in expansion of macro 'agxbuse' 218 | return agxbuse(xb); | ^~~~~~~ emit.c: In function 'emit_xdot': emit.c:941:11: warning: variable 'fontname' set but not used [-Wunused-but-set-variable] 941 | char* fontname; | ^~~~~~~~ emit.c:940:12: warning: variable 'fontsize' set but not used [-Wunused-but-set-variable] 940 | double fontsize; | ^~~~~~~~ emit.c: In function 'selectedlayer': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ emit.c:1152:22: note: in expansion of macro 'agxbuse' 1152 | w1 = w0 = strtok(agxbuse(&xb), gvc->layerDelims); | ^~~~~~~ emit.c: In function 'nodeIntersect': emit.c:2247:11: warning: variable 'target' set but not used [-Wunused-but-set-variable] 2247 | char* target; | ^~~~~~ emit.c:2246:11: warning: variable 'tooltip' set but not used [-Wunused-but-set-variable] 2246 | char* tooltip; | ^~~~~~~ emit.c: In function 'xdotBB': emit.c:2474:12: warning: variable 'sz' set but not used [-Wunused-but-set-variable] 2474 | pointf sz; | ^~ emit.c: In function 'style_token': emit.c:3262:16: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 3262 | int token, rc; | ^~ emit.c: In function 'parse_style': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:3356:17: note: in expansion of macro 'agxbputc' 3356 | agxbputc(&ps_xb, '\0'); /* terminate previous */ | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ emit.c:3359:29: note: in expansion of macro 'agxbuse' 3359 | agxbput(&ps_xb, agxbuse(&xb)); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:3360:13: note: in expansion of macro 'agxbputc' 3360 | agxbputc(&ps_xb, '\0'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ emit.c:3372:11: note: in expansion of macro 'agxbuse' 3372 | (void)agxbuse(&ps_xb); /* adds final '\0' to buffer */ | ^~~~~~~ In file included from /usr/include/stdio.h:980, from types.h:17, from render.h:40: In function 'sprintf', inlined from 'getObjId' at emit.c:215:5: /usr/include/x86_64-linux-gnu/bits/stdio2.h:30:10: warning: 'idnum' may be used uninitialized [-Wmaybe-uninitialized] 30 | return __builtin___sprintf_chk (__s, __USE_FORTIFY_LEVEL - 1, | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 31 | __glibc_objsize (__s), __fmt, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 32 | __va_arg_pack ()); | ~~~~~~~~~~~~~~~~~ emit.c: In function 'getObjId': emit.c:182:10: note: 'idnum' was declared here 182 | long idnum; | ^~~~~ emit.c:214:5: warning: 'pfx' may be used uninitialized [-Wmaybe-uninitialized] 214 | agxbput (xb, pfx); | ^~~~~~~~~~~~~~~~~ emit.c:183:11: note: 'pfx' was declared here 183 | char* pfx; | ^~~ emit.c: In function 'xdotBB': emit.c:2515:18: warning: 'fontsize' may be used uninitialized [-Wmaybe-uninitialized] 2515 | sz = textsize (g, op->para, fontname, fontsize); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:2471:12: note: 'fontsize' was declared here 2471 | double fontsize; | ^~~~~~~~ emit.c:2515:18: warning: 'fontname' may be used uninitialized [-Wmaybe-uninitialized] 2515 | sz = textsize (g, op->para, fontname, fontsize); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:2472:11: note: 'fontname' was declared here 2472 | char* fontname; | ^~~~~~~~ In function 'multicolor', inlined from 'emit_edge_graphics' at emit.c:1814:10, inlined from 'emit_edge' at emit.c:2389:2, inlined from 'emit_edge' at emit.c:2350:13: emit.c:1776:13: warning: 'endcolor' may be used uninitialized [-Wmaybe-uninitialized] 1776 | gvrender_set_fillcolor(job, endcolor); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c: In function 'emit_edge': emit.c:1723:11: note: 'endcolor' was declared here 1723 | char* endcolor; | ^~~~~~~~ In function 'emit_edge_graphics', inlined from 'emit_edge' at emit.c:2389:2, inlined from 'emit_edge' at emit.c:2350:13: emit.c:1921:17: warning: 'bz.list' may be used uninitialized [-Wmaybe-uninitialized] 1921 | arrow_gen(job, EMIT_TDRAW, bz.sp, bz.list[0], | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1922 | arrowsize, penwidth, bz.sflag); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c: In function 'emit_edge': emit.c:1792:12: note: 'bz.list' was declared here 1792 | bezier bz; | ^~ In function 'emit_edge_graphics', inlined from 'emit_edge' at emit.c:2389:2, inlined from 'emit_edge' at emit.c:2350:13: emit.c:1932:61: warning: 'bz.size' may be used uninitialized [-Wmaybe-uninitialized] 1932 | arrow_gen(job, EMIT_HDRAW, bz.ep, bz.list[bz.size - 1], | ~~^~~~~ emit.c: In function 'emit_edge': emit.c:1792:12: note: 'bz.size' was declared here 1792 | bezier bz; | ^~ In function 'emit_edge_graphics', inlined from 'emit_edge' at emit.c:2389:2, inlined from 'emit_edge' at emit.c:2350:13: emit.c:1913:16: warning: 'bz.sflag' may be used uninitialized [-Wmaybe-uninitialized] 1913 | if (bz.sflag) { | ^ emit.c: In function 'emit_edge': emit.c:1792:12: note: 'bz.sflag' was declared here 1792 | bezier bz; | ^~ In function 'emit_edge_graphics', inlined from 'emit_edge' at emit.c:2389:2, inlined from 'emit_edge' at emit.c:2350:13: emit.c:1924:16: warning: 'bz.eflag' may be used uninitialized [-Wmaybe-uninitialized] 1924 | if (bz.eflag) { | ^ emit.c: In function 'emit_edge': emit.c:1792:12: note: 'bz.eflag' was declared here 1792 | bezier bz; | ^~ CCLD libcommon_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/common' make[4]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 arith.h geom.h color.h types.h textpara.h usershape.h '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/common' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/common' Making install in pack make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/pack' CC ccomps.lo CC pack.lo pack.c: In function 'putGraphs': pack.c:953:12: warning: 'pts' may be used uninitialized [-Wmaybe-uninitialized] 953 | return pts; | ^~~ pack.c:920:12: note: 'pts' was declared here 920 | point* pts; | ^~~ CCLD libpack_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/pack' make[4]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 pack.3 '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 pack.3.pdf '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 pack.h '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/pack' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/pack' Making install in xdot make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/xdot' CC xdot.lo xdot.c: In function 'sprintXDot': xdot.c:537:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 537 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ xdot.c:538:21: note: in expansion of macro 'agxbputc' 538 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ xdot.c:606:16: note: in expansion of macro 'agxbuse' 606 | s = strdup(agxbuse(&xb)); | ^~~~~~~ CCLD libxdot.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libxdot_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/xdot' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libxdot.la '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libxdot.lai /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libxdot.la libtool: install: /usr/bin/install -c .libs/libxdot.a /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libxdot.a libtool: install: chmod 644 /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libxdot.a libtool: install: ranlib /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libxdot.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 xdot.3 '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 xdot.3.pdf '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libxdot.pc '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 xdot.h '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/xdot' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/xdot' Making install in gvc make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/gvc' CC gvrender.lo CC gvlayout.lo CC gvdevice.lo In file included from ../../lib/common/types.h:18, from gvplugin_device.h:17, from gvdevice.c:55: gvdevice.c: In function 'gvfwrite': gvdevice.c:269:12: warning: suggest parentheses around assignment used as truth value [-Wparentheses] 269 | assert(size = sizeof(char)); | ^~~~ CC gvloadimage.lo CC gvcontext.lo CC gvjobs.lo CC gvevent.lo CC gvplugin.lo In file included from gvplugin.c:23: gvplugin.c: In function 'gvplugin_list': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvplugin.c:392:17: note: in expansion of macro 'agxbputc' 392 | agxbputc(&xb,' '); agxbput(&xb, (*pnext)->typestr); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvplugin.c:393:17: note: in expansion of macro 'agxbputc' 393 | agxbputc(&xb,':'); agxbput(&xb, (*pnext)->package->name); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvplugin.c:410:17: note: in expansion of macro 'agxbputc' 410 | agxbputc(&xb,' '); agxbput(&xb, q); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvplugin.c:423:14: note: in expansion of macro 'agxbuse' 423 | bp = agxbuse(&xb); | ^~~~~~~ CC gvconfig.lo CC gvtextlayout.lo CC gvusershape.lo gvusershape.c: In function 'gvusershape_open': gvusershape.c:415:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation] 415 | if (!(us->data = (void*)find_user_shape(us->name))) | ^~ gvusershape.c:417:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if' 417 | free(us); | ^~~~ CC gvc.lo CCLD libgvc.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgvc_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/gvc' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgvc.la '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libgvc.lai /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libgvc.la libtool: install: /usr/bin/install -c .libs/libgvc.a /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libgvc.a libtool: install: chmod 644 /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libgvc.a libtool: install: ranlib /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/libgvc.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 gvc.3 '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 gvc.3.pdf '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libgvc.pc '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 gvc.h gvcext.h gvplugin.h gvcjob.h gvcommon.h gvplugin_render.h gvplugin_layout.h gvconfig.h gvplugin_textlayout.h gvplugin_device.h gvplugin_loadimage.h '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/gvc' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/gvc' Making install in circogen make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/circogen' CC circularinit.lo CC nodelist.lo CC block.lo CC edgelist.lo CC circular.lo CC deglist.lo CC blocktree.lo CC blockpath.lo CC circpos.lo In function 'positionChildren', inlined from 'position' at circpos.c:421:2, inlined from 'doBlock' at circpos.c:468:6: circpos.c:338:20: warning: 'midAngle' may be used uninitialized [-Wmaybe-uninitialized] 338 | PSI(pi->n) = midAngle; circpos.c: In function 'doBlock': circpos.c:264:39: note: 'midAngle' was declared here 264 | double mindistAngle, rotateAngle, midAngle; | ^~~~~~~~ CC nodeset.lo CCLD libcircogen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/circogen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/circogen' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/circogen' Making install in dotgen make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/dotgen' CC acyclic.lo CC class1.lo CC class2.lo CC cluster.lo CC compound.lo CC conc.lo CC decomp.lo CC fastgr.lo CC flat.lo CC dotinit.lo CC mincross.lo In function 'balanceNodes', inlined from 'balance' at mincross.c:506:3, inlined from 'mincross.constprop' at mincross.c:638:6: mincross.c:414:12: warning: 'sepIndex' may be used uninitialized [-Wmaybe-uninitialized] 414 | for (i = sepIndex - 1; i >= 0; i--) { | ~~^~~~~~~~~~~~~~ mincross.c: In function 'mincross.constprop': mincross.c:374:9: note: 'sepIndex' was declared here 374 | int sepIndex; | ^~~~~~~~ CC position.lo CC rank.lo CC sameport.lo CC dotsplines.lo dotsplines.c: In function 'makeLineEdge': dotsplines.c:1604:30: warning: right-hand operand of comma expression has no effect [-Wunused-value] 1604 | lp = ED_label(e)->pos, lp; | ^ dotsplines.c: In function 'completeregularpath': dotsplines.c:1866:9: warning: variable 'pn' set but not used [-Wunused-but-set-variable] 1866 | int pn; | ^~ dotsplines.c:1865:13: warning: variable 'pp' set but not used [-Wunused-but-set-variable] 1865 | pointf *pp; | ^~ dotsplines.c: In function '_dot_splines': dotsplines.c:882:12: warning: 'lminx' may be used uninitialized [-Wmaybe-uninitialized] 882 | double lminx, lmaxx; | ^~~~~ dotsplines.c:882:19: warning: 'lmaxx' may be used uninitialized [-Wmaybe-uninitialized] 882 | double lminx, lmaxx; | ^~~~~ dotsplines.c:488:9: warning: 'edges' may be used uninitialized [-Wmaybe-uninitialized] 488 | free(edges); | ^~~~~~~~~~~ dotsplines.c:268:50: note: 'edges' was declared here 268 | edge_t *e, *e0, *e1, *ea, *eb, *le0, *le1, **edges; | ^~~~~ dotsplines.c:489:15: warning: 'P' may be used uninitialized [-Wmaybe-uninitialized] 489 | free(P->boxes); | ~^~~~~~~ dotsplines.c:269:11: note: 'P' was declared here 269 | path *P; | ^ CC aspect.lo aspect.c: In function 'computeCombiAR': aspect.c:1614:12: warning: variable 'maxLayerIndex' set but not used [-Wunused-but-set-variable] 1614 | int i, maxLayerIndex; | ^~~~~~~~~~~~~ In function 'reduceMaxWidth2', inlined from 'applyPacking2' at aspect.c:1088:5, inlined from 'rank3' at aspect.c:1824:2: aspect.c:737:25: warning: 'maxLayerIndex' may be used uninitialized [-Wmaybe-uninitialized] 737 | layerWidthInfo[maxLayerIndex].nNodeGroupsInLayer, | ^ aspect.c: In function 'rank3': aspect.c:702:9: note: 'maxLayerIndex' was declared here 702 | int maxLayerIndex; | ^~~~~~~~~~~~~ In function 'reduceMaxWidth2', inlined from 'applyPacking2' at aspect.c:1088:5, inlined from 'rank3' at aspect.c:1824:2: aspect.c:749:8: warning: 'nextMaxWidth' may be used uninitialized [-Wmaybe-uninitialized] 749 | if (nextMaxWidth <= layerWidthInfo[maxLayerIndex].width / 4 | ^ aspect.c: In function 'rank3': aspect.c:703:12: note: 'nextMaxWidth' was declared here 703 | double nextMaxWidth; | ^~~~~~~~~~~~ CCLD libdotgen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/dotgen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/dotgen' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/dotgen' Making install in fdpgen make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/fdpgen' CC comp.lo CC dbg.lo CC grid.lo CC fdpinit.lo CC layout.lo CC tlayout.lo CC xlayout.lo CC clusteredges.lo CCLD libfdpgen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/fdpgen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/fdpgen' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/fdpgen' Making install in neatogen make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/neatogen' CC adjust.lo adjust.c: In function 'getSizes': adjust.c:674:48: warning: 'nedge_nodes' may be used uninitialized [-Wmaybe-uninitialized] 674 | if (elabels && IS_LNODE(n)) nedge_nodes++; | ~~~~~~~~~~~^~ adjust.c:670:12: note: 'nedge_nodes' was declared here 670 | int i, nedge_nodes; | ^~~~~~~~~~~ adjust.c: In function 'removeOverlapWith': adjust.c:1045:9: warning: 'ret' may be used uninitialized [-Wmaybe-uninitialized] 1045 | int ret; | ^~~ CC circuit.lo CC edges.lo CC geometry.lo CC heap.lo CC hedges.lo CC info.lo CC neatoinit.lo CC legal.lo CC lu.lo CC matinv.lo CC memory.lo CC poly.lo CC printvis.lo CC site.lo CC solve.lo CC neatosplines.lo neatosplines.c: In function 'makeObstacle': neatosplines.c:363:13: warning: variable 'desc' set but not used [-Wunused-but-set-variable] 363 | epsf_t *desc; | ^~~~ neatosplines.c: In function '_spline_edges': neatosplines.c:603:15: warning: unused variable 'rtr' [-Wunused-variable] 603 | router_t* rtr = 0; | ^~~ CC stuff.lo CC voronoi.lo voronoi.c: In function 'voronoi': voronoi.c:46:49: warning: 'newintstar.y' may be used uninitialized [-Wmaybe-uninitialized] 45 | if (newsite != (struct Site *) NULL && (PQempty() | ~~~~~~~~~ 46 | || newsite->coord.y < | ^~~~~~~~~~~~~~~~~~~~~ 47 | newintstar.y | ~~~~~~~~~~~~ voronoi.c:26:11: note: 'newintstar.y' was declared here 26 | Point newintstar; | ^~~~~~~~~~ CC stress.lo stress.c: In function 'mdsModel': stress.c:1383:19: warning: 'delta' may be used uninitialized [-Wmaybe-uninitialized] 1383 | delta += abs(Dij[i*nG + j - shift] - graph[i].ewgts[e]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ stress.c:1370:12: note: 'delta' was declared here 1370 | double delta; | ^~~~~ CC kkutils.lo CC matrix_ops.lo CC embed_graph.lo CC dijkstra.lo CC conjgrad.lo CC pca.lo CC closest.lo CC bfs.lo CC constraint.lo CC quad_prog_solve.lo CC smart_ini_x.lo CC constrained_majorization.lo CC opt_arrangement.lo CC overlap.lo CC call_tri.lo CC compute_hierarchy.lo CC delaunay.lo CC multispline.lo CCLD libneatogen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/neatogen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/neatogen' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/neatogen' Making install in twopigen make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/twopigen' CC twopiinit.lo CC circle.lo In function 'getRankseps', inlined from 'setAbsolutePos' at circle.c:299:15, inlined from 'circleLayout' at circle.c:368:5: circle.c:285:12: warning: 'delx' may be used uninitialized [-Wmaybe-uninitialized] 285 | xf += delx; | ~~~^~~~~~~ circle.c: In function 'circleLayout': circle.c:268:20: note: 'delx' was declared here 268 | double xf = 0, delx, d; | ^~~~ CCLD libtwopigen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/twopigen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/twopigen' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/twopigen' Making install in sfdpgen make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/sfdpgen' CC sfdpinit.lo CC spring_electrical.lo spring_electrical.c: In function 'rotate': spring_electrical.c:1850:8: warning: variable 'y' set but not used [-Wunused-but-set-variable] 1850 | real y[4], axis[2], center[2], x0, x1; | ^ CC LinkedList.lo CC sparse_solve.lo CC post_process.lo post_process.c: In function 'StressMajorizationSmoother2_new': post_process.c:110:36: warning: variable 'dd' set but not used [-Wunused-but-set-variable] 110 | real *avg_dist, diag_d, diag_w, *dd, dist, s = 0, stop = 0, sbot = 0; | ^~ post_process.c: In function 'StressMajorizationSmoother_smooth': post_process.c:578:102: warning: variable 'res' set but not used [-Wunused-but-set-variable] 578 | real *w, *dd, *d, *y = NULL, *x0 = NULL, *x00 = NULL, diag, diff = 1, *lambda = sm->lambda, maxit, res, alpha = 0., M = 0.; | ^~~ post_process.c:578:9: warning: variable 'w' set but not used [-Wunused-but-set-variable] 578 | real *w, *dd, *d, *y = NULL, *x0 = NULL, *x00 = NULL, diag, diff = 1, *lambda = sm->lambda, maxit, res, alpha = 0., M = 0.; | ^ post_process.c:577:32: warning: variable 'jw' set but not used [-Wunused-but-set-variable] 577 | int i, j, m, *id, *jd, *iw, *jw, idiag, flag = 0, iter = 0; | ^~ post_process.c:577:27: warning: variable 'iw' set but not used [-Wunused-but-set-variable] 577 | int i, j, m, *id, *jd, *iw, *jw, idiag, flag = 0, iter = 0; | ^~ post_process.c: In function 'TriangleSmoother_new': post_process.c:698:68: warning: variable 'jd' set but not used [-Wunused-but-set-variable] 698 | int i, j, k, m = A->m, *ia = A->ia, *ja = A->ja, *iw, *jw, *id, *jd, jdiag, nz; | ^~ post_process.c:698:63: warning: variable 'id' set but not used [-Wunused-but-set-variable] 698 | int i, j, k, m = A->m, *ia = A->ia, *ja = A->ja, *iw, *jw, *id, *jd, jdiag, nz; | ^~ CC stress_model.lo CC uniform_stress.lo uniform_stress.c: In function 'uniform_stress': uniform_stress.c:112:8: warning: variable 'res' set but not used [-Wunused-but-set-variable] 112 | real res; | ^~~ CC QuadTree.lo CC Multilevel.lo Multilevel.c: In function 'maximal_independent_vertex_set': Multilevel.c:87:30: warning: variable 'n' set but not used [-Wunused-but-set-variable] 87 | int i, ii, j, *ia, *ja, m, n, *p = NULL; | ^ Multilevel.c: In function 'maximal_independent_vertex_set_RS': Multilevel.c:138:57: warning: variable 'removed' set but not used [-Wunused-but-set-variable] 138 | int i, jj, ii, *p = NULL, j, k, *ia, *ja, m, n, gain, removed, nf = 0; | ^~~~~~~ Multilevel.c:138:48: warning: variable 'n' set but not used [-Wunused-but-set-variable] 138 | int i, jj, ii, *p = NULL, j, k, *ia, *ja, m, n, gain, removed, nf = 0; | ^ Multilevel.c: In function 'maximal_independent_edge_set_heavest_edge_pernode_leaves_first': Multilevel.c:327:30: warning: variable 'n' set but not used [-Wunused-but-set-variable] 327 | int i, ii, j, *ia, *ja, m, n, *p = NULL, q; | ^ Multilevel.c: In function 'maximal_independent_edge_set_heavest_edge_pernode_supernodes_first': Multilevel.c:502:30: warning: variable 'n' set but not used [-Wunused-but-set-variable] 502 | int i, ii, j, *ia, *ja, m, n, *p = NULL; | ^ Multilevel.c: In function 'maximal_independent_edge_set_heavest_cluster_pernode_leaves_first': Multilevel.c:646:30: warning: variable 'n' set but not used [-Wunused-but-set-variable] 646 | int i, ii, j, *ia, *ja, m, n, *p = NULL, q, iv; | ^ CC PriorityQueue.lo CCLD libsfdpgen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/sfdpgen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/sfdpgen' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/sfdpgen' Making install in osage make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/osage' CC osageinit.lo CCLD libosage_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/osage' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/osage' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib/osage' make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib' make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib' make[2]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/lib' Making install in plugin make[2]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin' Making install in core make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/core' CC gvplugin_core.lo CC gvrender_core_dot.lo In file included from gvrender_core_dot.c:32: gvrender_core_dot.c: In function 'xdot_str': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvrender_core_dot.c:100:5: note: in expansion of macro 'agxbputc' 100 | agxbputc(xbufs[emit_state], ' '); | ^~~~~~~~ gvrender_core_dot.c: In function 'xdot_points': gvrender_core_dot.c:107:12: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 107 | int i, rc; | ^~ gvrender_core_dot.c: In function 'xdot_style': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvrender_core_dot.c:162:13: note: in expansion of macro 'agxbputc' 162 | agxbputc(&xbuf, '('); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvrender_core_dot.c:166:21: note: in expansion of macro 'agxbputc' 166 | agxbputc(&xbuf, ','); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvrender_core_dot.c:172:13: note: in expansion of macro 'agxbputc' 172 | agxbputc(&xbuf, ')'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:174:30: note: in expansion of macro 'agxbuse' 174 | xdot_str (job, "S ", agxbuse(&xbuf)); | ^~~~~~~ gvrender_core_dot.c: In function 'xdot_end_node': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:186:38: note: in expansion of macro 'agxbuse' 186 | agxset(n, xd->n_draw->index, agxbuse(xbufs[EMIT_NDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:192:40: note: in expansion of macro 'agxbuse' 192 | agxset(n, xd->n_l_draw->index, agxbuse(xbufs[EMIT_NLABEL])); | ^~~~~~~ gvrender_core_dot.c: In function 'xdot_end_edge': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:206:38: note: in expansion of macro 'agxbuse' 206 | agxset(e, xd->e_draw->index, agxbuse(xbufs[EMIT_EDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:212:38: note: in expansion of macro 'agxbuse' 212 | agxset(e, xd->t_draw->index, agxbuse(xbufs[EMIT_TDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:218:38: note: in expansion of macro 'agxbuse' 218 | agxset(e, xd->h_draw->index, agxbuse(xbufs[EMIT_HDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:224:39: note: in expansion of macro 'agxbuse' 224 | agxset(e, xd->e_l_draw->index,agxbuse(xbufs[EMIT_ELABEL])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:230:39: note: in expansion of macro 'agxbuse' 230 | agxset(e, xd->tl_draw->index, agxbuse(xbufs[EMIT_TLABEL])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:236:39: note: in expansion of macro 'agxbuse' 236 | agxset(e, xd->hl_draw->index, agxbuse(xbufs[EMIT_HLABEL])); | ^~~~~~~ gvrender_core_dot.c: In function 'xdot_end_cluster': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:289:42: note: in expansion of macro 'agxbuse' 289 | agxset(cluster_g, xd->g_draw->index, agxbuse(xbufs[EMIT_CDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:295:48: note: in expansion of macro 'agxbuse' 295 | agxset(cluster_g, xd->g_l_draw->index, agxbuse(xbufs[EMIT_CLABEL])); | ^~~~~~~ gvrender_core_dot.c: In function 'xdot_end_graph': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:436:38: note: in expansion of macro 'agxbuse' 436 | agxset(g, xd->g_draw->index, agxbuse(xbufs[EMIT_GDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:444:40: note: in expansion of macro 'agxbuse' 444 | agxset(g, xd->g_l_draw->index, agxbuse(xbufs[EMIT_GLABEL])); | ^~~~~~~ CC gvrender_core_fig.lo CC gvrender_core_map.lo CC gvrender_core_ps.lo CC gvrender_core_svg.lo CC gvrender_core_tk.lo gvrender_core_tk.c: In function 'tkgen_print_tags': gvrender_core_tk.c:58:18: warning: variable 'ObjId' set but not used [-Wunused-but-set-variable] 58 | unsigned int ObjId; | ^~~~~ gvrender_core_tk.c:57:21: warning: variable 'ObjPart' set but not used [-Wunused-but-set-variable] 57 | char *ObjType, *ObjPart; | ^~~~~~~ CC gvrender_core_vml.lo gvrender_core_vml.c: In function 'vml_ellipse': gvrender_core_vml.c:452:38: warning: variable 'bottom' set but not used [-Wunused-but-set-variable] 452 | double dx, dy, left, right, top, bottom; | ^~~~~~ gvrender_core_vml.c:452:26: warning: variable 'right' set but not used [-Wunused-but-set-variable] 452 | double dx, dy, left, right, top, bottom; | ^~~~~ CC gvloadimage_core.lo gvloadimage_core.c:19:22: warning: extra tokens at end of #include directive 19 | #include # for read() declaration | ^ CCLD libgvplugin_core_C.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgvplugin_core.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/core' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgvplugin_core.la '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz' libtool: install: /usr/bin/install -c .libs/libgvplugin_core.lai /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_core.la libtool: install: /usr/bin/install -c .libs/libgvplugin_core.a /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_core.a libtool: install: chmod 644 /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_core.a libtool: install: ranlib /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_core.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz ---------------------------------------------------------------------- Libraries have been installed in: /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/core' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/core' Making install in dot_layout make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/dot_layout' CC gvplugin_dot_layout.lo CC gvlayout_dot_layout.lo CCLD libgvplugin_dot_layout_C.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgvplugin_dot_layout.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/dot_layout' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgvplugin_dot_layout.la '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz' libtool: install: /usr/bin/install -c .libs/libgvplugin_dot_layout.lai /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_dot_layout.la libtool: install: /usr/bin/install -c .libs/libgvplugin_dot_layout.a /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_dot_layout.a libtool: install: chmod 644 /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_dot_layout.a libtool: install: ranlib /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_dot_layout.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz ---------------------------------------------------------------------- Libraries have been installed in: /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/dot_layout' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/dot_layout' Making install in neato_layout make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/neato_layout' CC gvplugin_neato_layout.lo CC gvlayout_neato_layout.lo CCLD libgvplugin_neato_layout_C.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgvplugin_neato_layout.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/neato_layout' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgvplugin_neato_layout.la '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz' libtool: install: /usr/bin/install -c .libs/libgvplugin_neato_layout.lai /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_neato_layout.la libtool: install: /usr/bin/install -c .libs/libgvplugin_neato_layout.a /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_neato_layout.a libtool: install: chmod 644 /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_neato_layout.a libtool: install: ranlib /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_neato_layout.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz ---------------------------------------------------------------------- Libraries have been installed in: /tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/neato_layout' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin/neato_layout' make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin' make[4]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin' make[2]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz/plugin' make[2]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz' make[3]: Entering directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz' make[3]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man7' /usr/bin/install -c -m 644 graphviz.7 '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/man/man7' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 graphviz_version.h '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz' /usr/bin/mkdir -p '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc' /usr/bin/install -c -m 644 AUTHORS COPYING ChangeLog NEWS cpl1.0.txt '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/share/graphviz/doc' make[3]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz' make[2]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz' make[1]: Leaving directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/graphviz' cp: -r not specified; omitting directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/graphviz' cp: -r not specified; omitting directory '/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/lib/pkgconfig' checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for zlib.h... yes checking for deflateBound in -lz... yes checking for library containing pow... -lm checking for _Bool... yes checking for stdbool.h that conforms to C99 or later... yes checking for whether compiler has bool... yes configure: Using the following compilation and linking flags for Rgraphviz configure: PKG_CFLAGS= -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz configure: PKG_LIBS=libxdot.a libgvplugin_dot_layout.a libgvplugin_neato_layout.a libgvplugin_core.a libgvc.a libpathplan.a libgraph.a libcdt.a -lz -lm configure: GVIZ_DEFS=-DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 configure: Compiling using Graphviz version: '2.28.0'. configure: Using bundled Graphviz: 'TRUE'. configure: creating ./config.status config.status: creating R/graphviz_build_version.R config.status: creating src/Makevars ** libs using C compiler: ‘gcc (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c LL_funcs.c -o LL_funcs.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Rgraphviz.c -o Rgraphviz.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RgraphvizInit.c -o RgraphvizInit.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c agopen.c -o agopen.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c agread.c -o agread.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c agwrite.c -o agwrite.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bezier.c -o bezier.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c buildEdgeList.c -o buildEdgeList.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c buildNodeList.c -o buildNodeList.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c doLayout.c -o doLayout.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c graphvizVersion.c -o graphvizVersion.o gcc -std=gnu17 -I"/usr/share/R/include" -DNDEBUG -I/tmp/RtmpoZAuEB/R.INSTALL160a207887b24/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -std=gnu17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o Rgraphviz.so LL_funcs.o Rgraphviz.o RgraphvizInit.o agopen.o agread.o agwrite.o bezier.o buildEdgeList.o buildNodeList.o doLayout.o graphvizVersion.o init.o libxdot.a libgvplugin_dot_layout.a libgvplugin_neato_layout.a libgvplugin_core.a libgvc.a libpathplan.a libgraph.a libcdt.a -lz -lm -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-Rgraphviz/00new/Rgraphviz/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (Rgraphviz) * installing *source* package ‘RBGL’ ... ** this is package ‘RBGL’ version ‘1.86.0’ ** package ‘RBGL’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bbc.cpp -o bbc.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:249:47: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >, boost::property > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:13, from bbc.cpp:37: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list >, boost::property > >]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >, boost::property > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; Buffer = d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight_t>, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; ColorMap = two_bit_color_map >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; Graph = boost::adjacency_list >, boost::property > >]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; Buffer = d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight_t>, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; ColorMap = two_bit_color_map >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; Graph = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >, boost::property > >; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map >, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >, boost::property > >; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map >, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cliques.cpp -o cliques.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c clusteringCoef.cpp -o clusteringCoef.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dominatorTree.cpp -o dominatorTree.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:15: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraphConcept > >::~BidirectionalGraphConcept()’ 118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G > | ^~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: note: in expansion of macro ‘BOOST_concept’ 118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:123:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 123 | BOOST_CONCEPT_USAGE(BidirectionalGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:15, from dominatorTree.cpp:2: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, edge_weight_t>, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:17: note: in a call to non-static member function ‘boost::InputIteratorConcept::~InputIteratorConcept()’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, edge_weight_t>, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, edge_weight_t>, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, edge_weight_t>, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c hcs.cpp -o hcs.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:20, from mincut.hpp:4, from hcs.cpp:2: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/string:51, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from RBGL.hpp:7: In static member function ‘static _Up* std::__copy_move<_IsMove, true, std::random_access_iterator_tag>::__copy_m(_Tp*, _Tp*, _Up*) [with _Tp = const int; _Up = int; bool _IsMove = false]’, inlined from ‘_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = const int*; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:506:30, inlined from ‘_OI std::__copy_move_a1(_II, _II, _OI) [with bool _IsMove = false; _II = const int*; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:533:42, inlined from ‘_OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false; _II = __gnu_cxx::__normal_iterator >; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:540:31, inlined from ‘_OI std::copy(_II, _II, _OI) [with _II = __gnu_cxx::__normal_iterator >; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:633:7, inlined from ‘static _ForwardIterator std::__uninitialized_copy::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator >; _ForwardIterator = int*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:147:27, inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator >; _ForwardIterator = int*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:185:15, inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator >; _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37, inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:606:31, inlined from ‘void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::vector; _Args = {const std::vector >&}; _Tp = std::vector]’ at /usr/include/c++/13/bits/new_allocator.h:191:4, inlined from ‘static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::vector; _Args = {const std::vector >&}; _Tp = std::vector]’ at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::vector; _Alloc = std::allocator >]’ at /usr/include/c++/13/bits/stl_vector.h:1286:30, inlined from ‘void HCS_internal(const Graph_ud&, V_Label&, ClusterResult&)’ at hcs.cpp:310:27: /usr/include/c++/13/bits/stl_algobase.h:437:30: warning: ‘void* __builtin_memmove(void*, const void*, long unsigned int)’ writing between 5 and 9223372036854775807 bytes into a region of size 4 overflows the destination [-Wstringop-overflow=] 437 | __builtin_memmove(__result, __first, sizeof(_Tp) * _Num); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function ‘_Tp* std::__new_allocator<_Tp>::allocate(size_type, const void*) [with _Tp = int]’, inlined from ‘static _Tp* std::allocator_traits >::allocate(allocator_type&, size_type) [with _Tp = int]’ at /usr/include/c++/13/bits/alloc_traits.h:482:28, inlined from ‘std::_Vector_base<_Tp, _Alloc>::pointer std::_Vector_base<_Tp, _Alloc>::_M_allocate(std::size_t) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:381:33, inlined from ‘std::_Vector_base<_Tp, _Alloc>::pointer std::_Vector_base<_Tp, _Alloc>::_M_allocate(std::size_t) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:378:7, inlined from ‘void std::_Vector_base<_Tp, _Alloc>::_M_create_storage(std::size_t) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:398:44, inlined from ‘std::_Vector_base<_Tp, _Alloc>::_Vector_base(std::size_t, const allocator_type&) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:335:26, inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:603:61, inlined from ‘void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::vector; _Args = {const std::vector >&}; _Tp = std::vector]’ at /usr/include/c++/13/bits/new_allocator.h:191:4, inlined from ‘static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::vector; _Args = {const std::vector >&}; _Tp = std::vector]’ at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::vector; _Alloc = std::allocator >]’ at /usr/include/c++/13/bits/stl_vector.h:1286:30, inlined from ‘void HCS_internal(const Graph_ud&, V_Label&, ClusterResult&)’ at hcs.cpp:310:27: /usr/include/c++/13/bits/new_allocator.h:151:55: note: destination object of size 4 allocated by ‘operator new’ 151 | return static_cast<_Tp*>(_GLIBCXX_OPERATOR_NEW(__n * sizeof(_Tp))); | ^ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c incrConnComp.cpp -o incrConnComp.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c interfaces.cpp -o interfaces.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/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 interfaces.cpp:3: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = dfs_time_visitor; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = dfs_time_visitor; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/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 interfaces.cpp:4: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = bfs_time_visitor; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = dfs_time_visitor]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:192:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = bfs_time_visitor; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::components_recorder]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:115:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:119:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = bfs_time_visitor]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::biconnected_components_visitor >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:211:27: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::tarjan_scc_visitor >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::biconnected_components_visitor, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c minST.cpp -o minST.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ComparableConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ComparableConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:251:17: note: in a call to non-static member function ‘boost::ComparableConcept::~ComparableConcept()’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:251:3: note: in expansion of macro ‘BOOST_concept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::IntegerConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:66:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:70:17: note: in a call to non-static member function ‘boost::IntegerConcept::~IntegerConcept()’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:70:3: note: in expansion of macro ‘BOOST_concept’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ComparableConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15, from minST.cpp:3: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c mincut.cpp -o mincut.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edge_connectivity.hpp:20, from mincut.hpp:4, from mincut.cpp:2: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ordering.cpp -o ordering.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/bind/mem_fn.hpp:23, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/bind/bind.hpp:23, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/king_ordering.hpp:18, from ordering.cpp:9: /home/omnipath/local/R/4.5-3.21/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:16, from ordering.cpp:2: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>::~AdaptableUnaryFunctionConcept()’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, int, const int&, boost::vertex_index_t>, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:588:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/sparse_ordering.hpp:20, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15, from ordering.cpp:3: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction::~UnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 321 | BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void()); } | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:588:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, int, const int&, boost::vertex_index_t>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, int, const int&, boost::vertex_index_t>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, int, const int&, boost::vertex_index_t>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:588:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::dfs_visitor<>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:450:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:463:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = void*; Y = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:588:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = char; typename std::iterator_traits< >::reference = char&; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:152:13: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:191:13: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:218:14: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:239:14: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:255: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:213:23: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector; SinglePassRange2 = std::vector]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:213:23: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector; BinaryPredicate = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::compare_multiplicity]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = int; typename std::iterator_traits< >::reference = int&; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector, std::allocator > >; BinaryPredicate = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::edge_cmp]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept, std::allocator > > >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params >, std::deque > > >, buffer_param_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = void*; Y = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:213:23: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = detail::isomorphism_algo >, adjacency_list >, iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = detail::isomorphism_algo >, adjacency_list >, iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; Graph = boost::adjacency_list >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = detail::isomorphism_algo >, adjacency_list >, iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector, std::allocator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::incrementable_traversal_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::single_pass_traversal_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:152:13: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘typename boost::range_difference::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >; UnaryPredicate = boost::indirect_pmap >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, char, char&> >; typename boost::range_difference::type = long int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:333:51: required from ‘bool boost::detail::isomorphism_algo::match(edge_iter, int) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; edge_iter = std::vector, std::allocator > >::iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params >, std::deque > > >, buffer_param_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params >, std::deque > > >, buffer_param_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; Graph = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params >, std::deque > > >, buffer_param_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor<>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list > > >]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = detail::isomorphism_algo >, adjacency_list >, iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c planar.cpp -o planar.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, long unsigned int, long unsigned int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, long unsigned int, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>::~AdaptableUnaryFunctionConcept()’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:588:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept, boost::property > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:192:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, long unsigned int, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction::~UnaryFunction() [with Func = boost::degree_vertex_invariant >, boost::adjacency_list >; Return = long unsigned int; Arg = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 321 | BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void()); } | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = planar_dfs_visitor >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list, property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph, boost::property > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept, boost::property > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:192:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:450:11: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:450:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, boost::adjacency_list >; Return = long unsigned int; Arg = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = char; typename std::iterator_traits< >::reference = char&; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:152:13: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:191:13: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:218:14: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:239:14: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:255: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector; SinglePassRange2 = std::vector]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:213:23: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = int; typename std::iterator_traits< >::reference = int&; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector >; BinaryPredicate = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::edge_cmp]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:255:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept > >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list, property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list, property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list; DFSVisitor = detail::isomorphism_algo, adjacency_list, shared_array_property_map >, degree_vertex_invariant >, adjacency_list >, degree_vertex_invariant >, adjacency_list >, vec_adj_list_vertex_id_map, vec_adj_list_vertex_id_map, unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list; DFSVisitor = detail::isomorphism_algo, adjacency_list, shared_array_property_map >, degree_vertex_invariant >, adjacency_list >, degree_vertex_invariant >, adjacency_list >, vec_adj_list_vertex_id_map, vec_adj_list_vertex_id_map, unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; Graph = boost::adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list; DFSVisitor = detail::isomorphism_algo, adjacency_list, shared_array_property_map >, degree_vertex_invariant >, adjacency_list >, degree_vertex_invariant >, adjacency_list >, vec_adj_list_vertex_id_map, vec_adj_list_vertex_id_map, unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::incrementable_traversal_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::single_pass_traversal_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:152:13: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘typename boost::range_difference::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >; UnaryPredicate = boost::indirect_pmap >, boost::vec_adj_list_vertex_id_map, char, char&> >; typename boost::range_difference::type = long int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:333:51: required from ‘bool boost::detail::isomorphism_algo::match(edge_iter, int) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >; edge_iter = std::vector >::iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:258:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; InvariantCountMap = boost::unordered::unordered_flat_map, std::equal_to, std::allocator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list, property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order, boost::adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::odd_components_counter]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::biconnected_components_visitor >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list; DFSVisitor = detail::isomorphism_algo, adjacency_list, shared_array_property_map >, degree_vertex_invariant >, adjacency_list >, degree_vertex_invariant >, adjacency_list >, vec_adj_list_vertex_id_map, vec_adj_list_vertex_id_map, unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:238:38: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map, boost::unordered::unordered_flat_map, std::equal_to, std::allocator > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c registerSigHandlers.cpp -o registerSigHandlers.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c shortestPath.cpp -o shortestPath.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept, long unsigned int, double>::~BasicMatrixConcept()’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix::~BasicMatrix() [with M = Basic2DMatrix; I = long unsigned int; V = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 516 | BOOST_CONCEPT_USAGE(BasicMatrix) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:16, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:13, from shortestPath.cpp:5: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from shortestPath.cpp:3: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sna.cpp -o sna.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept, long unsigned int, double>::~BasicMatrixConcept()’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix::~BasicMatrix() [with M = Basic2DMatrix; I = long unsigned int; V = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 516 | BOOST_CONCEPT_USAGE(BasicMatrix) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/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 /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:29, from sna.cpp:3: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.5-3.21/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 = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/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 = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c transitive_closure.cpp -o transitive_closure.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/bind/mem_fn.hpp:23, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/bind/bind.hpp:23, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /home/omnipath/local/R/4.5-3.21/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/get_pointer.hpp:14: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:17: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:21: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:17: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:157:5: required from ‘struct boost::concepts::AdjacencyGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘struct boost::concepts::AdjacencyGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:15: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraphConcept >::~AdjacencyGraphConcept()’ 152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: note: in expansion of macro ‘BOOST_concept’ 152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:295:5: required from ‘struct boost::concepts::VertexMutableGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:292:1: required from ‘struct boost::concepts::VertexMutableGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexMutableGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:75:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexMutableGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:75:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:292:15: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraphConcept >::~VertexMutableGraphConcept()’ 292 | BOOST_concept(VertexMutableGraph, (G)) | ^~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:292:1: note: in expansion of macro ‘BOOST_concept’ 292 | BOOST_concept(VertexMutableGraph, (G)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:279:5: required from ‘struct boost::concepts::EdgeMutableGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:275:1: required from ‘struct boost::concepts::EdgeMutableGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeMutableGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:76:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeMutableGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:76:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:275:15: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraphConcept >::~EdgeMutableGraphConcept()’ 275 | BOOST_concept(EdgeMutableGraph, (G)) | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:275:1: note: in expansion of macro ‘BOOST_concept’ 275 | BOOST_concept(EdgeMutableGraph, (G)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:157:5: required from ‘struct boost::concepts::AdjacencyGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘struct boost::concepts::AdjacencyGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:157:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 157 | BOOST_CONCEPT_USAGE(AdjacencyGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:295:5: required from ‘struct boost::concepts::VertexMutableGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:292:1: required from ‘struct boost::concepts::VertexMutableGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexMutableGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:75:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraph::~VertexMutableGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:295:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 295 | BOOST_CONCEPT_USAGE(VertexMutableGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:279:5: required from ‘struct boost::concepts::EdgeMutableGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:275:1: required from ‘struct boost::concepts::EdgeMutableGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeMutableGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:76:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraph::~EdgeMutableGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:279:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 279 | BOOST_CONCEPT_USAGE(EdgeMutableGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:115:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:119:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = graph_visitor_t; R = bgl_named_params, long unsigned int>, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, parameter::aux::arg_list, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:129:27: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:162:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = graph_visitor_t; R = bgl_named_params, long unsigned int>, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, parameter::aux::arg_list, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/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 | ^ /home/omnipath/local/R/4.5-3.21/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) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = graph_visitor_t; R = bgl_named_params, long unsigned int>, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, parameter::aux::arg_list, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:406:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/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( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.5-3.21/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.5-3.21/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.5-3.21/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-wwoKA3/r-base-4.5.1=/usr/src/r-base-4.5.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c wavefront.cpp -o wavefront.o In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.5-3.21/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.5-3.21/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.5-3.21/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o RBGL.so bbc.o cliques.o clusteringCoef.o dominatorTree.o edmonds_optimum_branching.o hcs.o incrConnComp.o interfaces.o minST.o mincut.o ordering.o planar.o registerSigHandlers.o shortestPath.o sna.o transitive_closure.o wavefront.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.5-3.21/00LOCK-RBGL/00new/RBGL/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (RBGL) The downloaded source packages are in ‘/tmp/RtmpAMOq6W/downloaded_packages’ [ Finished: 2025-10-30 22:01:24 CET ]